Sciweavers

3652 search results - page 508 / 731
» A study of query length
Sort
View
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
16 years 8 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch
WWW
2001
ACM
16 years 7 months ago
Scaling question answering to the Web
The wealth of information on the web makes it an attractive resource for seeking quick answers to simple, factual questions such as "who was the first American in space?"...
Cody C. T. Kwok, Oren Etzioni, Daniel S. Weld
STOC
2009
ACM
123views Algorithms» more  STOC 2009»
16 years 7 months ago
An improved constant-time approximation algorithm for maximum~matchings
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
Yuichi Yoshida, Masaki Yamamoto, Hiro Ito
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 7 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
VLDB
2009
ACM
159views Database» more  VLDB 2009»
16 years 6 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...