2767 search results - page 152 / 554 » Universal Exponentiation Algorithm |
107
click to vote
STOC
2002
ACM
16 years 2 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...
STOC
2001
ACM
16 years 2 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...
95
Voted
ALT
2008
Springer
15 years 10 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...
ICASSP
2008
IEEE
15 years 8 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...
104
Voted
ACSD
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a po...