Sciweavers

2883 search results - page 173 / 577
» Algorithms for merged indexes
Sort
View
SSD
2001
Springer
111views Database» more  SSD 2001»
15 years 10 months ago
Querying Mobile Objects in Spatio-Temporal Databases
In dynamic spatio-temporal environments where objects may continuously move in space, maintaining consistent information about the location of objects and processing motion-speciļ¬...
Kriengkrai Porkaew, Iosif Lazaridis, Sharad Mehrot...
TCSV
2002
67views more  TCSV 2002»
15 years 5 months ago
A new compression scheme for color-quantized images
An efficient compression scheme for color-quantized images based on progressive coding of color information has been developed. Instead of sorting color indexes into a linear list ...
Xin Chen, Sam Kwong, Ju-fu Feng
ICDE
2011
IEEE
233views Database» more  ICDE 2011»
14 years 9 months ago
Answering approximate string queries on large data sets using external memory
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
Alexander Behm, Chen Li, Michael J. Carey
CIKM
2011
Springer
14 years 6 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
INFOCOM
2011
IEEE
14 years 9 months ago
Scalable and fully distributed localization with mere connectivity
Abstract—This work proposes a novel connectivity-based localization algorithm, well suitable for large-scale sensor networks with complex shapes and non-uniform nodal distributio...
Miao Jin, Su Xia, Hongyi Wu, Xianfeng Gu