Sciweavers

18 search results - page 3 / 4
» Sideways Information Passing for Push-Style Query Processing
Sort
View
DAMON
2007
Springer
14 years 12 days ago
Pipelined hash-join on multithreaded architectures
Multi-core and multithreaded processors present both opportunities and challenges in the design of database query processing algorithms. Previous work has shown the potential for ...
Philip Garcia, Henry F. Korth
ICANN
2005
Springer
13 years 11 months ago
Fast Color-Based Object Recognition Independent of Position and Orientation
Small mobile robots typically have little on-board processing power for time-consuming vision algorithms. Here we show how they can quickly extract very dense yet highly useful inf...
Martijn van de Giessen, Jürgen Schmidhuber
GIS
2009
ACM
14 years 1 months ago
Constrained reverse nearest neighbor search on mobile objects
In this paper, we formalize the novel concept of Constrained Reverse k-Nearest Neighbor (CRkNN) search on mobile objects (clients) performed at a central server. The CRkNN query c...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
TON
2002
175views more  TON 2002»
13 years 5 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
13 years 11 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...