Sciweavers

230 search results - page 30 / 46
» Minimum Spanning Tree Problem with Label Selection
Sort
View
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
14 years 7 days ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
ICDCSW
2003
IEEE
14 years 2 months ago
Computation of Minimal Uniform Transmission Power in Ad Hoc Wireless Networks
Power conservation is a critical issue for ad hoc wireless networks. The main objective of the paper is to find the minimum uniform transmission power of an ad hoc wireless netwo...
Qing Dai, Jie Wu
CVPR
2008
IEEE
14 years 10 months ago
Graph-shifts: Natural image labeling by dynamic hierarchical computing
In this paper, we present a new approach for image labeling based on the recently introduced graph-shifts algorithm. Graph-shifts is an energy minimization algorithm that does lab...
Jason J. Corso, Alan L. Yuille, Zhuowen Tu
ICASSP
2011
IEEE
13 years 12 days ago
Pronunciation variation modeling of non-native proper names by discriminative tree search
In this paper, the task of selecting the optimal subset of pronunciation variants from a set of automatically generated candidates is recast as a tree search problem. In this appr...
Line Adde, Torbjørn Svendsen
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
14 years 3 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...