Sciweavers

48 search results - page 4 / 10
» Fast local searches and updates in bounded universes
Sort
View
FAST
2009
13 years 3 months ago
Spyglass: Fast, Scalable Metadata Search for Large-Scale Storage Systems
The scale of today's storage systems has made it increasingly difficult to find and manage files. To address this, we have developed Spyglass, a file metadata search system t...
Andrew W. Leung, Minglong Shao, Timothy Bisson, Sh...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 11 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
NAR
2006
170views more  NAR 2006»
13 years 5 months ago
The UCSC Genome Browser Database: update 2006
The University of California Santa Cruz Genome Browser Database (GBD) contains sequence and annotation data for the genomes of about a dozen vertebrate species and several major m...
Angela S. Hinrichs, Donna Karolchik, Robert Baerts...
HAPTICS
2002
IEEE
13 years 10 months ago
Six-Degree-of-Freedom Haptic Display Using Localized Contact Computations
: We present a six-degree-of-freedom haptic rendering algorithm using localized contact computations. It takes advantage of high motion coherence due to fast force update and spati...
Young J. Kim, Miguel A. Otaduy, Ming C. Lin, Dines...
SIGMOD
2001
ACM
184views Database» more  SIGMOD 2001»
14 years 5 months ago
Locally Adaptive Dimensionality Reduction for Indexing Large Time Series Databases
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
Eamonn J. Keogh, Kaushik Chakrabarti, Sharad Mehro...