Sciweavers

23 search results - page 4 / 5
» External perfect hashing for very large key sets
Sort
View
CIVR
2007
Springer
273views Image Analysis» more  CIVR 2007»
16 years 1 days ago
Scalable near identical image and shot detection
This paper proposes and compares two novel schemes for near duplicate image and video-shot detection. The first approach is based on global hierarchical colour histograms, using ...
Ondrej Chum, James Philbin, Michael Isard, Andrew ...
SPAA
2003
ACM
15 years 11 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
DSMML
2004
Springer
15 years 11 months ago
Redundant Bit Vectors for Quickly Searching High-Dimensional Regions
Applications such as audio fingerprinting require search in high dimensions: find an item in a database that is similar to a query. An important property of this search task is t...
Jonathan Goldstein, John C. Platt, Christopher J. ...
GIS
2005
ACM
16 years 7 months ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
BMCBI
2005
103views more  BMCBI 2005»
15 years 5 months ago
Many accurate small-discriminatory feature subsets exist in microarray transcript data: biomarker discovery
Background: Molecular profiling generates abundance measurements for thousands of gene transcripts in biological samples such as normal and tumor tissues (data points). Given such...
Leslie Grate