Sciweavers

272 search results - page 36 / 55
» The compressed permuterm index
Sort
View
FOCS
2000
IEEE
15 years 4 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
15 years 6 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
SPIRE
2005
Springer
15 years 5 months ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez
MIR
2004
ACM
242views Multimedia» more  MIR 2004»
15 years 5 months ago
Content based access for a massive database of human observation video
We present in this paper a CBIR system for use in a psychological study of the relationship between human movement and Dyslexia. The system allows access to up to 500 hours of vid...
Laurent Joyeux, Erika Doyle, Hugh Denman, Andrew C...
DBKDA
2010
IEEE
169views Database» more  DBKDA 2010»
15 years 4 months ago
XLeaf: Twig Evaluation with Skipping Loop Joins and Virtual Nodes
Abstract—XML indexing and search has become an important topic, and twig joins are key building blocks in XML search systems. This paper describes a novel approach using a nested...
Nils Grimsmo, Truls Amundsen Bjørklund, &Os...