2398 search results - page 183 / 480 » Constraint Programming and Graph Algorithms |
172
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
In order to handle device matching in analog circuits, some pairs of modules are required to be placed symmetrically. This paper addresses this device-level placement problem for ...
160
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
173
click to vote
CIVR
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents a new approach for video clip retrieval based on Earth Mover’s Distance (EMD). Instead of imposing one-to-one matching constraint as in [11, 14], our approach...
174
click to vote
IPPS
2006
IEEE
16 years 12 days ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
208
click to vote
APLAS
2010
ACM
15 years 5 months ago
2010
ACM
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...