Sciweavers

719 search results - page 96 / 144
» Solving Sparse Linear Constraints
Sort
View
JSAT
2006
134views more  JSAT 2006»
14 years 11 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
CVPR
2008
IEEE
16 years 1 months ago
Global pose estimation using non-tree models
We propose a novel global pose estimation method to detect body parts of articulated objects in images based on non-tree graph models. There are two kinds of edges defined in the ...
Hao Jiang, David R. Martin
GD
2005
Springer
15 years 4 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
TOG
2002
98views more  TOG 2002»
14 years 10 months ago
Synthesis of complex dynamic character motion from simple animations
In this paper we present a general method for rapid prototyping of realistic character motion. We solve for the natural motion from a simple animation provided by the animator. Ou...
C. Karen Liu, Zoran Popovic
CONSTRAINTS
2011
14 years 2 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...