Sciweavers

4850 search results - page 197 / 970
» Approximate Data Structures with Applications
Sort
View
ICASSP
2009
IEEE
16 years 1 months ago
Affine invariant features and their application to speech recognition
This paper proposes a set of affine invariant features (AIFs) for sequence data. The proposed AIFs can be calculated directly from the sequence data, and their invariance to af...
Yu Qiao, Masayuki Suzuki, Nobuaki Minematsu
ICWE
2010
Springer
15 years 8 months ago
Designing Service Marts for Engineering Search Computing Applications
: The use of patterns in data management is not new: in data warehousing, data marts are simple conceptual schemas with exactly one core entity, describing facts, surrounded by mul...
Alessandro Campi, Stefano Ceri, Andrea Maesani, St...

Publication
217views
17 years 6 months ago
Towards Efficient Search on Unstructured Data: An Intelligent-Storage Approach
Applications that create and consume unstructured data have grown both in scale of storage requirements and complexity of search primitives. We consider two such applications: exha...
Aravindan Raghuveer, Biplob K. Debnath, David Hung...
P2P
2007
IEEE
156views Communications» more  P2P 2007»
16 years 18 days ago
Completeness Estimation of Range Queries in Structured Overlays
Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be ...
Marcel Karnstedt, Kai-Uwe Sattler, Roman Schmidt
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 6 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...