Sciweavers

125 search results - page 19 / 25
» Indexing time vs. query time: trade-offs in dynamic informat...
Sort
View
CLEF
2006
Springer
13 years 11 months ago
Domain Specific Retrieval: Back to Basics
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2006. This year we are not using the tools for thesaurus-based query expansion a...
Ray R. Larson
HCI
2007
13 years 8 months ago
Static and Dynamic Hand-Gesture Recognition for Augmented Reality Applications
This contribution presents our approach for an instrumented automatic gesture recognition system for use in Augmented Reality, which is able to differentiate static and dynamic ges...
Stefan Reifinger, Frank Wallhoff, Markus Abla&szli...
SIGMOD
2010
ACM
166views Database» more  SIGMOD 2010»
13 years 5 months ago
Efficient two-sided error-tolerant search
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Hannah Bast, Marjan Celikik
ISMIR
2005
Springer
155views Music» more  ISMIR 2005»
14 years 27 days ago
MATCH: A Music Alignment Tool Chest
We present MATCH, a toolkit for aligning audio recordings of different renditions of the same piece of music, based on an efficient implementation of a dynamic time warping algor...
Simon Dixon, Gerhard Widmer
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo