Sciweavers

1418 search results - page 270 / 284
» A Theory of Stream Queries
Sort
View
SIGIR
2003
ACM
14 years 28 days ago
Evaluating different methods of estimating retrieval quality for resource selection
In a federated digital library system, it is too expensive to query every accessible library. Resource selection is the task to decide to which libraries a query should be routed....
Henrik Nottelmann, Norbert Fuhr
AWIC
2003
Springer
14 years 28 days ago
From Search Engines to Question-Answering Systems - The Need for New Tools
Abstract Search engines, with Google at the top, have many remarkable capabilities. But what is not among them is the deduction capability—the capability to synthesize an answer ...
Lotfi A. Zadeh
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 9 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
AAAI
1994
13 years 9 months ago
Learning to Reason
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...
Roni Khardon, Dan Roth