Sciweavers

1088 search results - page 109 / 218
» Probabilistic query expansion using query logs
Sort
View
ECCC
2010
80views more  ECCC 2010»
13 years 9 months ago
Query Complexity in Errorless Hardness Amplification
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
Thomas Watson
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
14 years 10 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
COCO
2005
Springer
124views Algorithms» more  COCO 2005»
14 years 2 months ago
Tolerant Versus Intolerant Testing for Boolean Properties
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
Eldar Fischer, Lance Fortnow
WWW
2010
ACM
14 years 4 months ago
The paths more taken: matching DOM trees to search logs for accurate webpage clustering
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
Deepayan Chakrabarti, Rupesh R. Mehta
INFOCOM
2002
IEEE
14 years 1 months ago
Probabilistic Location and Routing
Abstract—We propose probabilistic location to enhance the performance of existing peer-to-peer location mechanisms in the case where a replica for the queried data item exists cl...
Sean C. Rhea, John Kubiatowicz