Sciweavers

150 search results - page 15 / 30
» Solving Small TSPs with Constraints
Sort
View
IJCGA
2000
64views more  IJCGA 2000»
13 years 7 months ago
High Fidelity Interval Assignment
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
Scott A. Mitchell
ICCV
2009
IEEE
15 years 16 days ago
Efficient Discriminative Learning of Parts-based Models
Supervised learning of a parts-based model can be for- mulated as an optimization problem with a large (exponen- tial in the number of parts) set of constraints. We show how thi...
M. Pawan Kumar, Andrew Zisserman, Philip H.S. Torr
SOFSEM
2007
Springer
14 years 1 months ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan
ECCV
2010
Springer
13 years 11 months ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
TAP
2008
Springer
93views Hardware» more  TAP 2008»
13 years 7 months ago
Pex-White Box Test Generation for .NET
Pex automatically produces a small test suite with high code coverage for a .NET program. To this end, Pex performs a systematic program analysis (using dynamic symbolic execution,...
Nikolai Tillmann, Jonathan de Halleux