Sciweavers

2217 search results - page 220 / 444
» Rank-aware Query Optimization
Sort
View
WWW
2007
ACM
16 years 7 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
SIGMOD
2006
ACM
102views Database» more  SIGMOD 2006»
16 years 6 months ago
DADA: a data cube for dominant relationship analysis
The concept of dominance has recently attracted much interest in the context of skyline computation. Given an Ndimensional data set S, a point p is said to dominate q if p is bett...
Cuiping Li, Beng Chin Ooi, Anthony K. H. Tung, Sha...
PODS
2006
ACM
138views Database» more  PODS 2006»
16 years 6 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri
ALT
2009
Springer
16 years 3 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
CIKM
2009
Springer
16 years 1 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles