1007 search results - page 90 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
131
click to vote
WWW
2007
ACM
16 years 3 months ago
2007
ACM
Search queries applied to extract relevant information from the World Wide Web over a period of time may be denoted as continuous search queries. The improvement of continuous sea...
125
click to vote
SIGMOD
1998
ACM
15 years 7 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
125
click to vote
PDP
2006
IEEE
15 years 9 months ago
2006
IEEE
— The Parallel Resource-Optimal (PRO) computation model was introduced by Gebremedhin et al. [2002] as a framework for the design and analysis of efficient parallel algorithms. ...
115
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper considers a network composed of robotic agents and static nodes performing spatial estimation of a dynamic physical processes. The physical process is modeled as a s...
155
click to vote
GIS
2008
ACM
15 years 4 months ago
2008
ACM
In this paper we study in-network query processing in disconnected mobile environments, where both ad-hoc communication and infrastructure communication are available. Depending o...