Sciweavers

3368 search results - page 421 / 674
» The Complexity of Query Reliability
Sort
View
SIGSOFT
2009
ACM
16 years 7 months ago
Engineering search computing applications: vision and challenges
Search computing is a novel discipline whose goal is to answer complex, multi-domain queries. Such queries typically require combining in their results domain knowledge extracted ...
Marco Brambilla, Stefano Ceri
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
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 6 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
2004
ACM
120views Database» more  SIGMOD 2004»
16 years 6 months ago
Prediction and Indexing of Moving Objects with Unknown Motion Patterns
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias, ...