3020 search results - page 303 / 604 » Optimal partition trees |
179
click to vote
IVC
2002
15 years 6 months ago
2002
This paper presents a novel three-dimensional model-based tracking system which has been incorporated into a visual servoing system. The tracking system combines modern graphical ...
190
click to vote
DAM
1999
15 years 6 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
165
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
286
click to vote
DAC
1998
ACM
15 years 10 months ago
1998
ACM
Interconnect-driven optimization is an increasingly important step in high-performance design. Algorithms for buffer insertion have been successfully utilized to reduce delay in gl...
232
click to vote
APPROX
2005
Springer
16 years 7 days ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...