628 search results - page 103 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
145
click to vote
AMAI
2004
Springer
15 years 8 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
130
click to vote
CVPR
2006
IEEE
16 years 4 months ago
2006
IEEE
We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this po...
129
click to vote
INFOCOM
2002
IEEE
15 years 7 months ago
2002
IEEE
Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In...
104
click to vote
DAC
2009
ACM
16 years 3 months ago
2009
ACM
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
99
Voted
DAC
2009
ACM
15 years 9 months ago
2009
ACM
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...