Grant: Discovery Grants Program - Individual
Simon Fraser University
$30,000.00
Algorithms and lower bounds for sublinear processing of long sequences and large data
EF 2010-11
Résumé
As more and more applications are generating and storing massive amounts of data, the processing of large data is becoming crucial in many fields. In this proposal we are interested in processing large amounts of data in the presence of resource constraints. In particular, we would like to develop algorithms in the property testing, streaming, and sensor network aggregation models, allowing time and/or space sublinear in the size of the input. Clearly, such tight restrictions imply that the solutions provided by our algorithms cannot be fully accurate in many cases; one of our goals is to explore the tradeoff between accuracy and efficiency in these models. We will focus on problems related to properties of sequences, but will explore other areas as we develop more techniques.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
298343-2009
Name nom
Ergun, AyseFunda
Department département
Computing Science
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2009
Award amount
30000
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
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
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
2
Nb partie
5
Application title
Algorithms and lower bounds for sublinear processing of long sequences and large data
Keyword
NSERC
Application summary
As more and more applications are generating and storing massive amounts of data, the processing of large data is becoming crucial in many fields. In this proposal we are interested in processing large amounts of data in the presence of resource constraints. In particular, we would like to develop algorithms in the property testing, streaming, and sensor network aggregation models, allowing time and/or space sublinear in the size of the input. Clearly, such tight restrictions imply that the solutions provided by our algorithms cannot be fully accurate in many cases; one of our goals is to explore the tradeoff between accuracy and efficiency in these models. We will focus on problems related to properties of sequences, but will explore other areas as we develop more techniques.