Sciweavers

5153 search results - page 433 / 1031
» Introduction to Randomized Algorithms
Sort
View
ISAAC
2000
Springer
110views Algorithms» more  ISAAC 2000»
15 years 11 months ago
Online Routing in Convex Subdivisions
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante ...
AAAI
2008
15 years 10 months ago
Studies in Solution Sampling
We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
Vibhav Gogate, Rina Dechter
ALT
2010
Springer
15 years 9 months ago
A Regularization Approach to Metrical Task Systems
We address the problem of constructing randomized online algorithms for the Metrical Task Systems (MTS) problem on a metric against an oblivious adversary. Restricting our attenti...
Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder...
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
15 years 9 months ago
On distance to monotonicity and longest increasing subsequence of a data stream
In this paper we consider problems related to the sortedness of a data stream. First we investigate the problem of estimating the distance to monotonicity; given a sequence of len...
Funda Ergün, Hossein Jowhari
NIPS
2004
15 years 9 months ago
Newscast EM
We propose a gossip-based distributed algorithm for Gaussian mixture learning, Newscast EM. The algorithm operates on network topologies where each node observes a local quantity ...
Wojtek Kowalczyk, Nikos A. Vlassis