Sciweavers

1088 search results - page 104 / 218
» Probabilistic query expansion using query logs
Sort
View
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 9 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 4 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
WWW
2006
ACM
14 years 9 months ago
Optimizing scoring functions and indexes for proximity search in type-annotated corpora
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
Soumen Chakrabarti, Kriti Puniyani, Sujatha Das
NIPS
2001
13 years 10 months ago
The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank
The PageRank algorithm, used in the Google search engine, greatly improves the results of Web search by taking into account the link structure of the Web. PageRank assigns to a pa...
Matthew Richardson, Pedro Domingos
IPSN
2004
Springer
14 years 2 months ago
A probabilistic approach to inference with limited information in sensor networks
We present a methodology for a sensor network to answer queries with limited and stochastic information using probabilistic techniques. This capability is useful in that it allows...
Rahul Biswas, Sebastian Thrun, Leonidas J. Guibas