Sciweavers

583 search results - page 97 / 117
» Finding Answers to Complex Questions
Sort
View
DEBU
2000
101views more  DEBU 2000»
13 years 7 months ago
Learning to Understand the Web
In a traditional information retrieval system, it is assumed that queries can be posed about any topic. In reality, a large fraction of web queries are posed about a relatively sm...
William W. Cohen, Andrew McCallum, Dallan Quass
ECIR
2007
Springer
13 years 9 months ago
Enhancing Expert Search Through Query Modeling
An expert finding is a very common task among enterprise search activities, while its usual retrieval performance is far from the quality of the Web search. Query modeling helps t...
Pavel Serdyukov, Sergey Chernov, Wolfgang Nejdl
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 7 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 8 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 8 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman