Sciweavers

672 search results - page 70 / 135
» Almost Optimal Dispersers
Sort
View
COLT
1998
Springer
14 years 29 days ago
Learning One-Variable Pattern Languages in Linear Average Time
A new algorithm for learning one-variable pattern languages is proposed and analyzed with respect to its average-case behavior. We consider the total learning time that takes into...
Rüdiger Reischuk, Thomas Zeugmann
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 24 days ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
FOCS
1990
IEEE
14 years 23 days ago
Complexity of Unification in Free Groups and Free Semi-groups
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
Antoni Koscielski, Leszek Pacholski
WSC
2007
13 years 11 months ago
Simulating the patient move: transitioning to a replacement hospital
One of the more complex maneuvers a hospital system can perform is moving an entire patient population from an old facility to a replacement facility. All patients must be transpo...
Marshall Ashby, Martin J. Miller, David M. Ferrin,...
COLT
2008
Springer
13 years 10 months ago
Regret Bounds for Sleeping Experts and Bandits
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
Robert D. Kleinberg, Alexandru Niculescu-Mizil, Yo...