Sciweavers

320 search results - page 26 / 64
» Answering Queries from Statistics and Probabilistic Views
Sort
View
CORR
2002
Springer
121views Education» more  CORR 2002»
13 years 8 months ago
Answering Subcognitive Turing Test Questions: A Reply to French
Robert French has argued that a disembodied computer is incapable of passing a Turing Test that includes subcognitive questions. Subcognitive questions are designed to probe the n...
Peter D. Turney
CC
2008
Springer
131views System Software» more  CC 2008»
13 years 8 months ago
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
Marius Zimand
PVLDB
2008
122views more  PVLDB 2008»
13 years 8 months ago
Exploiting shared correlations in probabilistic databases
There has been a recent surge in work in probabilistic databases, propelled in large part by the huge increase in noisy data sources -from sensor data, experimental data, data fro...
Prithviraj Sen, Amol Deshpande, Lise Getoor
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 2 months ago
Ranking Query Results using Context-Aware Preferences
To better serve users’ information needs without requiring comprehensive queries from users, a simple yet effective technique is to explore the preferences of users. Since these...
Arthur H. van Bunningen, Maarten M. Fokkinga, Pete...
ICDT
2003
ACM
139views Database» more  ICDT 2003»
14 years 1 months ago
New Rewritings and Optimizations for Regular Path Queries
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
Gösta Grahne, Alex Thomo