Sciweavers

5624 search results - page 269 / 1125
» On Conditional Covering Problem
Sort
View
TSP
2010
15 years 1 months ago
Recovering signals from lowpass data
The problem of recovering a signal from its low frequency components occurs often in practical applications due to the lowpass behavior of many physical systems. Here we study in d...
Yonina C. Eldar, Volker Pohl
COLT
2006
Springer
15 years 10 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
JACM
2006
99views more  JACM 2006»
15 years 6 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
SODA
2012
ACM
243views Algorithms» more  SODA 2012»
13 years 9 months ago
Bidimensionality and geometric graphs
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
FOCS
2005
IEEE
16 years 8 days ago
On Learning Mixtures of Heavy-Tailed Distributions
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...
Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinbe...