Sciweavers

2398 search results - page 475 / 480
» Constraint Programming and Graph Algorithms
Sort
View
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 7 months ago
Parameterizing by the Number of Numbers
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...
Michael R. Fellows, Serge Gaspers, Frances A. Rosa...
IJFCS
2006
110views more  IJFCS 2006»
13 years 7 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
MICRO
2005
IEEE
126views Hardware» more  MICRO 2005»
14 years 28 days ago
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...
CVPR
2005
IEEE
14 years 9 months ago
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...
Tianli Yu, Jiebo Luo, Narendra Ahuja
ECCV
2004
Springer
14 years 9 months ago
What Do Four Points in Two Calibrated Images Tell Us about the Epipoles?
Suppose that two perspective views of four world points are given, that the intrinsic parameters are known, but the camera poses and the world point positions are not. We prove tha...
David Nistér, Frederik Schaffalitzky