107 search results - page 16 / 22 » Random sampling and approximation of MAX-CSP problems |
113
click to vote
UAI
2004
15 years 4 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
130
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
151
click to vote
WWW
2011
ACM
14 years 10 months ago
2011
ACM
Bucket testing, also known as A/B testing, is a practice that is widely used by on-line sites with large audiences: in a simple version of the methodology, one evaluates a new fea...
126
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
145
click to vote
ALT
1997
Springer
15 years 7 months ago
1997
Springer
Efficient learning of DFA is a challenging research problem in grammatical inference. It is known that both exact and approximate (in the PAC sense) identifiability of DFA is har...