982 search results - page 110 / 197 » Solving Steiner tree problems in graphs to optimality |
122
click to vote
STOC
1995
ACM
15 years 4 months ago
1995
ACM
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...
DCC
2002
IEEE
16 years 7 days ago
2002
IEEE
Let finite source and reproduction alphabets X and Y and a distortion measure d : X ? Y [0, ) be given. We study the minimum asymptotic rate required to describe a source distrib...
131
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
110
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
129
click to vote
EMMCVPR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...