Sciweavers

16404 search results - page 2474 / 3281
» A set coverage problem
Sort
View
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
16 years 7 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
16 years 7 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 7 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
SIGMOD
2006
ACM
162views Database» more  SIGMOD 2006»
16 years 7 months ago
Efficient query processing in geographic web search engines
Geographic web search engines allow users to constrain and order search results in an intuitive manner by focusing a query on a particular geographic region. Geographic search tec...
Yen-Yu Chen, Torsten Suel, Alexander Markowetz
SIGMOD
2006
ACM
125views Database» more  SIGMOD 2006»
16 years 7 months ago
A non-linear dimensionality-reduction technique for fast similarity search in large databases
To enable efficient similarity search in large databases, many indexing techniques use a linear transformation scheme to reduce dimensions and allow fast approximation. In this re...
Khanh Vu, Kien A. Hua, Hao Cheng, Sheau-Dong Lang
« Prev « First page 2474 / 3281 Last » Next »