Sciweavers

1331 search results - page 139 / 267
» Complexity bounds for zero-test algorithms
Sort
View
SODA
2008
ACM
111views Algorithms» more  SODA 2008»
14 years 11 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
AIPS
2009
14 years 11 months ago
Multi-Agent Online Planning with Communication
We propose an online algorithm for planning under uncertainty in multi-agent settings modeled as DEC-POMDPs. The algorithm helps overcome the high computational complexity of solv...
Feng Wu, Shlomo Zilberstein, Xiaoping Chen
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
15 years 10 months ago
Optimal oblivious routing in polynomial time
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...
FOCS
2009
IEEE
15 years 4 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
COLT
2010
Springer
14 years 8 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha