Sciweavers

495 search results - page 70 / 99
» Probability Trees
Sort
View
MST
2011
205views Hardware» more  MST 2011»
13 years 3 months ago
Sublinear Time Algorithms for Earth Mover's Distance
We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distributions. We give closeness t...
Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt ...
SIAMDM
2010
131views more  SIAMDM 2010»
13 years 3 months ago
On Optimal Strategies for a Hat Game on Graphs
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Uriel Feige
DSD
2011
IEEE
194views Hardware» more  DSD 2011»
12 years 8 months ago
Reliability-Aware Design Optimization for Multiprocessor Embedded Systems
—This paper presents an approach for the reliability-aware design optimization of real-time systems on multi-processor platforms. The optimization is based on an extension of wel...
Jia Huang, Jan Olaf Blech, Andreas Raabe, Christia...
STOC
2004
ACM
118views Algorithms» more  STOC 2004»
14 years 9 months ago
Boosted sampling: approximation algorithms for stochastic optimization
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
Anupam Gupta, Martin Pál, R. Ravi, Amitabh ...
DCC
2006
IEEE
14 years 8 months ago
Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions
Lossless compression is studied for pairs of independent integer-valued symbols emitted by a source with a geometric probability distribution of parameter q (0, 1). Optimal prefix...
Alfredo Viola, Frédérique Bassino, G...