663 search results - page 46 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
CAGD
2008
13 years 7 months ago
2008
Geometric constraints have proved to be helpful for shape modeling. Moreover, they are efficient aids in controlling deformations and enhancing animation realism. The present pape...
DAC
2005
ACM
13 years 9 months ago
2005
ACM
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Pairwise constraints specify whether or not two samples should be in one cluster. Although it has been successful to incorporate them into traditional clustering methods, such as ...
SARA
2009
Springer
14 years 8 days ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...