Sciweavers

1695 search results - page 117 / 339
» Linear, Polynomial or Exponential
Sort
View
STOC
2002
ACM
124views Algorithms» more  STOC 2002»
16 years 4 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»
16 years 4 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
ICASSP
2009
IEEE
15 years 11 months ago
Multi-layer ratio Semi-Definite Classifiers
We develop a novel extension to the Ratio Semi-definite Classifier, a discriminative model formulated as a ratio of semi-definite polynomials. By adding a hidden layer to the m...
Jonathan Malkin, Jeff Bilmes
ICASSP
2008
IEEE
15 years 11 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
ADAEUROPE
2007
Springer
15 years 10 months ago
Static Detection of Livelocks in Ada Multitasking Programs
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
Johann Blieberger, Bernd Burgstaller, Robert Mitte...