1603 search results - page 237 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
116
click to vote
ISBRA
2009
Springer
15 years 5 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
The simultaneity matrix is an × matrix of numbers. It is constructed according to a set of -bit solutions. The matrix element mij is the degree of linkage between bit positions i ...
ICCAD
1995
IEEE
15 years 1 months ago
1995
IEEE
Implementing a built-in self-test by a "test per clock" scheme offers advantages concerning fault coverage, detection of delay faults, and test application time. Such a ...
117
click to vote
CVPR
2009
IEEE
16 years 5 months ago
2009
IEEE
Convex and continuous energy formulations for low level
vision problems enable efficient search procedures for the
corresponding globally optimal solutions. In this work we
exte...
GD
2005
Springer
15 years 3 months ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...