Sciweavers

2767 search results - page 152 / 554
» Universal Exponentiation Algorithm
Sort
View
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
15 years 10 months ago
Clairvoyant scheduling of random walks
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...
Péter Gács
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
15 years 10 months ago
Compatible sequences and a slow Winkler percolation
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...
Péter Gács
ALT
2008
Springer
15 years 7 months ago
A Uniform Lower Error Bound for Half-Space Learning
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...
Andreas Maurer, Massimiliano Pontil
ICASSP
2008
IEEE
15 years 4 months ago
Ratio semi-definite classifiers
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...
Jonathan Malkin, Jeff Bilmes
75
Voted
ACSD
2007
IEEE
88views Hardware» more  ACSD 2007»
15 years 4 months ago
Testing the executability of scenarios in general inhibitor nets
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...
Robert Lorenz, Sebastian Mauser, Robin Bergenthum