329 search results - page 43 / 66 » Efficient Parallel Query Processing by Graph Ranking |
VLDB
2007
ACM
14 years 7 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
CLOUD
2010
ACM
14 years 14 days ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
To have a robust and informative image content representation for image categorization, we often need to extract as many as possible visual features at various locations, scales a...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Standard cursive handwriting recognition is based on a language model, mostly a lexicon of possible word hypotheses or character n-grams. The result is a list of word alternatives...