Sciweavers

25 search results - page 5 / 5
» The Boolean Formula Value Problem Is in ALOGTIME
Sort
View
ML
1998
ACM
131views Machine Learning» more  ML 1998»
13 years 5 months ago
Learning from Examples and Membership Queries with Structured Determinations
It is well known that prior knowledge or bias can speed up learning, at least in theory. It has proved di cult to make constructive use of prior knowledge, so that approximately c...
Prasad Tadepalli, Stuart J. Russell
STACS
2005
Springer
13 years 11 months ago
Algorithmics in Exponential Time
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
Uwe Schöning
SIGMOD
2008
ACM
122views Database» more  SIGMOD 2008»
13 years 5 months ago
UQBE: uncertain query by example for web service mashup
The UQBE is a mashup tool for non-programmers that supports query-by-example (QBE) over a schema made up by the user without knowing the schema of the original sources. Based on a...
Jun'ichi Tatemura, Songting Chen, Fenglin Liao, Ol...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 8 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
FOCS
2007
IEEE
13 years 12 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor