18306 search results - page 297 / 3662 » Algorithmics in Exponential Time |
191
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
A new "herding" algorithm is proposed which directly converts observed moments into a sequence of pseudo-samples. The pseudosamples respect the moment constraints and ma...
158
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
159
click to vote
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
152
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
Abstract. We give a lower bound for the error of any unitarily invariant algorithm learning half-spaces against the uniform or related distributions on the unit sphere. The bound i...
163
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a novel classification model that is formulated as a ratio of semi-definite polynomials. We derive an efficient learning algorithm for this classifier, and apply it...