Sciweavers

1279 search results - page 157 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
ESA
2006
Springer
139views Algorithms» more  ESA 2006»
14 years 19 days ago
Stochastic Shortest Paths Via Quasi-convex Maximization
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
Evdokia Nikolova, Jonathan A. Kelner, Matthew Bran...
ICDCS
2009
IEEE
14 years 3 months ago
Stochastic Multicast with Network Coding
The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource ...
Ajay Gopinathan, Zongpeng Li
PODS
2009
ACM
110views Database» more  PODS 2009»
14 years 9 months ago
Optimal tracking of distributed heavy hitters and quantiles
We consider the the problem of tracking heavy hitters and quantiles in the distributed streaming model. The heavy hitters and quantiles are two important statistics for characteri...
Ke Yi, Qin Zhang
GECCO
2008
Springer
177views Optimization» more  GECCO 2008»
13 years 10 months ago
Reduced computation for evolutionary optimization in noisy environment
Evolutionary Algorithms’ (EAs’) application to real world optimization problems often involves expensive fitness function evaluation. Naturally this has a crippling effect on ...
Maumita Bhattacharya
EMNLP
2008
13 years 10 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney