Sciweavers

2040 search results - page 151 / 408
» Approximate Expectation Maximization
Sort
View
143
Voted
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
15 years 3 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
TCOM
2008
116views more  TCOM 2008»
15 years 3 months ago
Bounds on the Distribution of a Sum of Correlated Lognormal Random Variables and Their Application
The cumulative distribution function (cdf) of a sum of correlated or even independent lognormal random variables (RVs), which is of wide interest in wireless communications, remain...
Chintha Tellambura
106
Voted
JDA
2007
73views more  JDA 2007»
15 years 3 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
138
Voted
NETWORKS
2011
14 years 10 months ago
Line planning, path constrained network flow and inapproximability
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
Christina Büsing, Sebastian Stiller
124
Voted
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
15 years 9 months ago
Path and trajectory diversity: Theory and algorithms
— We present heuristic algorithms for pruning large sets of candidate paths or trajectories down to smaller subsets that maintain desirable characteristics in terms of overall re...
Michael S. Branicky, Ross A. Knepper, James J. Kuf...