653 search results - page 92 / 131 » The size of minimum 3-trees |
117
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
This paper presents an algorithm for recovering the globally optimal 2D human figure detection using a loopy graph model. This is computationally challenging because the time comp...
DATE
2009
IEEE
15 years 6 months ago
2009
IEEE
—In modern sub-micron design, achieving low-skew clock distributions is facing challenges for high-performance circuits. Symmetric global clock distribution and clock tree synthe...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
—In this work we study the portfolio problem which is to find a good combination of multiple heuristics to solve given instances on parallel resources in minimum time. The resou...
109
click to vote
ACCV
2009
Springer
15 years 6 months ago
2009
Springer
We present a novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations ...
105
click to vote
WADS
2009
Springer
15 years 6 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...