Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Windsor

$20,000.00

Geometric optimization and applications

EF 2012-13

Résumé
My area of research is the study of algorithms for computational problems with a geometric content, particularly those requiring the optimization of one or more parameters. I study them per se, trying to find faster, better and simpler algorithms, both exact and approximate, than existing ones. I also implement the algorithms that I discover since implementations unravel complications that are often ignored in theoretical studies. Lately, I have got interested in solving geometric optimization problems over geometric data streams. In this model, we do not have enough space to store all the data streaming by. The question is what interesting computations can we do despite this limitation. For example, one might be interested in maintaining an approximate spanning ball, when we are only allowed to store the current ball. In another direction, I try to find application of geometric algorithms in other areas with the motive of finding interesting new geometric problems to solve. For instance, I have recently been involved with finding a unique way of determining the placement of n points on a line with the fewest pairwise distance queries. This is a problem that arises in computational biology in attempting to solve the restriction site mapping problem. This has motivated me to explore other problems arising in Computational Biology with a significant geometric content.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
227693-2010
Name nom
Mukhopadhyay, Asish
Department département
Computer Science, School of
Organization id
37
Institution établissement
University of Windsor
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2010
Award amount
20000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
3
Nb partie
5
Application title
Geometric optimization and applications
Keyword
NSERC
Application summary
My area of research is the study of algorithms for computational problems with a geometric content, particularly those requiring the optimization of one or more parameters. I study them per se, trying to find faster, better and simpler algorithms, both exact and approximate, than existing ones. I also implement the algorithms that I discover since implementations unravel complications that are often ignored in theoretical studies. Lately, I have got interested in solving geometric optimization problems over geometric data streams. In this model, we do not have enough space to store all the data streaming by. The question is what interesting computations can we do despite this limitation. For example, one might be interested in maintaining an approximate spanning ball, when we are only allowed to store the current ball. In another direction, I try to find application of geometric algorithms in other areas with the motive of finding interesting new geometric problems to solve. For instance, I have recently been involved with finding a unique way of determining the placement of n points on a line with the fewest pairwise distance queries. This is a problem that arises in computational biology in attempting to solve the restriction site mapping problem. This has motivated me to explore other problems arising in Computational Biology with a significant geometric content.