Sciweavers

2514 search results - page 365 / 503
» On the Computation of Approximations of Database Queries
Sort
View
ISMB
1994
15 years 8 months ago
Using Interval Logic for Order Assembly
Temporallogic, in particular, interval logic has been used to represent genomemapsand to assist genome mapconstructions. However,interval logic itself appears to be bruited in its...
Zhan Cui
197
Voted
ICALP
2004
Springer
16 years 7 days ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
CVPR
2007
IEEE
16 years 9 months ago
A Binning Scheme for Fast Hard Drive Based Image Search
In this paper we investigate how to scale a content based image retrieval approach beyond the RAM limits of a single computer and to make use of its hard drive to store the featur...
David Nistér, Friedrich Fraundorfer, Henrik...
SIGMOD
2005
ACM
153views Database» more  SIGMOD 2005»
16 years 7 months ago
Multiple Aggregations Over Data Streams
Monitoring aggregates on IP traffic data streams is a compelling application for data stream management systems. The need for exploratory IP traffic data analysis naturally leads ...
Rui Zhang 0003, Nick Koudas, Beng Chin Ooi, Divesh...
HCI
2009
15 years 4 months ago
A Similarity Measure for Vision-Based Sign Recognition
When we encounter an English word that we do not understand, we can look it up in a dictionary. However, when an American Sign Language (ASL) user encounters an unknown sign, looki...
Haijing Wang, Alexandra Stefan, Vassilis Athitsos