Sciweavers

1573 search results - page 302 / 315
» A Data Structure for Sponsored Search
Sort
View
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 4 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
VLDB
2001
ACM
94views Database» more  VLDB 2001»
15 years 4 months ago
FeedbackBypass: A New Approach to Interactive Similarity Query Processing
In recent years, several methods have been proposed for implementing interactive similarity queries on multimedia databases. Common to all these methods is the idea to exploit use...
Ilaria Bartolini, Paolo Ciaccia, Florian Waas
MOBICOM
2000
ACM
15 years 4 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson
STACS
1992
Springer
15 years 3 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
GBRPR
2007
Springer
15 years 3 months ago
Generalized vs Set Median Strings for Histogram-Based Distances: Algorithms and Classification Results in the Image Domain
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
Christine Solnon, Jean-Michel Jolion