Sciweavers

4037 search results - page 651 / 808
» Routing without ordering
Sort
View
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
16 years 4 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
16 years 4 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
16 years 3 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
PERCOM
2008
ACM
16 years 3 months ago
ReMo : An Energy Efficient Reprogramming Protocol for Mobile Sensor Networks
Existing code update protocols for reprogramming nodes in a sensor network are either unsuitable or inefficient when used in a mobile environment. The prohibitive factor of uncert...
Pradip De, Yonghe Liu, Sajal K. Das
DCC
2004
IEEE
16 years 3 months ago
Coding for Fast Access to Image Regions Defined by Pixel Range
Many technical imaging applications, like coding "images" of digital elevation maps, require extracting regions of compressed images in which the pixel values are within...
Amir Said, Sehoon Yea, William A. Pearlman