Sciweavers

128 search results - page 6 / 26
» Efficient Evaluation of Multiple Preference Queries
Sort
View
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
14 years 7 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
WWW
2009
ACM
14 years 8 months ago
RuralCafe: web search in the rural developing world
The majority of people in rural developing regions do not have access to the World Wide Web. Traditional network connectivity technologies have proven to be prohibitively expensiv...
Jay Chen, Lakshminarayanan Subramanian, Jinyang Li
IRFC
2011
Springer
12 years 10 months ago
Word Clouds of Multiple Search Results
Search engine result pages (SERPs) are known as the most expensive real estate on the planet. Most queries yield millions of organic search results, yet searchers seldom look beyon...
Rianne Kaptein, Jaap Kamps
GRID
2007
Springer
13 years 11 months ago
Optimizing multiple queries on scientific datasets with partial replicas
We propose strategies to efficiently execute a query workload, which consists of multiple related queries submitted against a scientific dataset, on a distributed-memory system in...
Li Weng, Ümit V. Çatalyürek, Tahs...