Sciweavers

517 search results - page 18 / 104
» Efficient Computation of Diverse Query Results
Sort
View
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 5 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
MOBIHOC
2003
ACM
14 years 7 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 7 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
ICASSP
2008
IEEE
14 years 2 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...
SIGIR
2008
ACM
13 years 7 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...