4524 search results - page 27 / 905 » The Complexity of Global Constraints |
147
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
Conventional global routing minimizes total wire length and congestion. Experiments using large industrial benchmark circuits show that up to 24% of nets in such routing solutions...
131
click to vote
SIAMJO
2008
15 years 6 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
143
click to vote
CVPR
2006
IEEE
16 years 7 days ago
2006
IEEE
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
170
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Given a set of 2D images, we propose a novel approach for the reconstruction of straight 3D line segments that represent the underlying geometry of static 3D objects in the scene....
173
click to vote
ACL
2009
15 years 4 months ago
2009
We propose a hybrid approach to coordinate structure analysis that combines a simple grammar to ensure consistent global structure of coordinations in a sentence, and features bas...