125 search results - page 4 / 25 » Indexing time vs. query time: trade-offs in dynamic informat... |
PETRA
2010
ACM
13 years 10 months ago
2010
ACM
We study the performance of three dynamic programming methods on music retrieval. The methods are designed for time series matching but can be directly applied to retrieval of mus...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
DEBU
2002
13 years 8 months ago
2002
Spatio-temporal databases store information about the positions of individual objects over time. In many applications however, such as traffic supervision or mobile communication ...
SIGIR
2009
ACM
14 years 3 months ago
2009
ACM
We proposed and implemented a novel clustering algorithm called LAIR2, which has constant running time average for on-the-fly Scatter/Gather browsing [4]. Our experiments showed ...
ESANN
2001
13 years 10 months ago
2001
Over the years the amount and range of electronic text stored on the WWW has expanded rapidly, overwhelming both users and tools designed to index and search the information. It is...