Sciweavers

759 search results - page 134 / 152
» Optimal Graph Search with Iterated Graph Cuts
Sort
View
CVPR
2008
IEEE
15 years 11 months ago
Enforcing convexity for improved alignment with constrained local models
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
CORR
2011
Springer
199views Education» more  CORR 2011»
14 years 1 months ago
Maximum Gain Round Trips with Cost Constraints
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
IEEEPACT
1997
IEEE
15 years 1 months ago
A Parallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
Yu-Kwong Kwok, Ishfaq Ahmad
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 1 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
CVPR
2011
IEEE
14 years 5 months ago
Enforcing Similarity Constraints with Integer Programming for Better Scene Text Recognition
The recognition of text in everyday scenes is made difficult by viewing conditions, unusual fonts, and lack of linguistic context. Most methods integrate a priori appearance info...
David Smith, Jacqueline Feild, Eric Learned-Miller