Sciweavers

517 search results - page 38 / 104
» Efficient Computation of Diverse Query Results
Sort
View
EVOW
2010
Springer
13 years 11 months ago
Local Search Algorithms on Graphics Processing Units. A Case Study: The Permutation Perceptron Problem
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 7 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 5 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
GIS
2007
ACM
14 years 8 months ago
Partition-based lazy updates for continuous queries over moving objects
Continuous spatial queries posted within an environment of moving objects produce as their results a time-varying set of objects. In the most ambitious case both queries and data ...
Yu-Ling Hsueh, Roger Zimmermann, Haojun Wang, Wei-...
WWW
2009
ACM
14 years 8 months ago
Using graphics processors for high performance IR query processing
Web search engines are facing formidable performance challenges as they need to process thousands of queries per second over billions of documents. To deal with this heavy workloa...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel