663 search results - page 41 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
3D reconstruction from an unordered set of images may fail due to incorrect epipolar geometries (EG) between image pairs arising from ambiguous feature correspondences. Previous m...
DAC
2002
ACM
14 years 8 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...
EXPDB
2006
ACM
14 years 1 months ago
2006
ACM
Current publish / subscribe systems offer a range of expressive subscription languages for constraints. However, classical systems restrict the publish operation to be a single p...
VLSID
2006
IEEE
14 years 1 months ago
2006
IEEE
Design space exploration is central to embedded system design. Typically this is a multi-objective search problem, where performance, power, area etc. are the different optimizati...