Sciweavers

1182 search results - page 209 / 237
» Iterative Methods in Combinatorial Optimization
Sort
View
AI
2008
Springer
13 years 10 months ago
Solving quantified constraint satisfaction problems
We make a number of contributions to the study of the Quantified Constraint Satisfaction Problem (QCSP). The QCSP is an extension of the constraint satisfaction problem that can b...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
CJ
1999
87views more  CJ 1999»
13 years 9 months ago
Evolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
Mayez A. Al-Mouhamed
PAMI
2007
159views more  PAMI 2007»
13 years 9 months ago
Soft Color Segmentation and Its Applications
—We propose an automatic approach to soft color segmentation, which produces soft color segments with an appropriate amount of overlapping and transparency essential to synthesiz...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang
SIGGRAPH
1998
ACM
14 years 2 months ago
Non-distorted Texture Mapping for Sheared Triangulated Meshes
This article introduces new techniques for non-distorted texture mapping on complex triangulated meshes. Texture coordinates are assigned to the vertices of the triangulation by u...
Bruno Lévy, Jean-Laurent Mallet
CVPR
2012
IEEE
12 years 8 days ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr