2430 search results - page 220 / 486 » Computing Tutte Polynomials |
140
click to vote
CVPR
2000
IEEE
16 years 6 months ago
2000
IEEE
The quest for a vision system capable of representing and recognizing arbitrary motions benefits from a low dimensional, non-specific representation of flow fields, to be used in ...
142
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
We present an analytic solution to the problem of estimating multiple 2-D and 3-D motion models from two-view correspondences or optical flow. The key to our approach is to view th...
117
click to vote
DAC
2009
ACM
16 years 5 months ago
2009
ACM
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
165
Voted
STOC
2004
ACM
16 years 4 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
116
click to vote
WG
2005
Springer
15 years 10 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...