Sciweavers

2182 search results - page 133 / 437
» A Robust Algorithm for Solving Nonlinear Programming Problem...
Sort
View
ICMCS
2005
IEEE
136views Multimedia» more  ICMCS 2005»
14 years 1 months ago
Soft Region Correspondence Estimation for Graph-Theoretic Image Retrieval Using Quadratic Programming Approach
This paper proposes employing a graph-theoretic approach to estimate the region correspondence between two images. We represent each image as an attributed undirected graph and tr...
Chuech-Yu Li, Chiou-Ting Hsu
COCOA
2010
Springer
13 years 5 months ago
Feasibility-Based Bounds Tightening via Fixed Points
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
CPAIOR
2004
Springer
13 years 11 months ago
A Global Constraint for Graph Isomorphism Problems
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
Sébastien Sorlin, Christine Solnon
FLAIRS
2004
13 years 9 months ago
A Local Search/Constraint Propagation Hybrid for a Network Routing Problem
This paper presents a hybrid algorithm that combines local search and constraint programming techniques to solve a network routing problem. The problem considered is that of routi...
Jonathan Lever
CVPR
2008
IEEE
14 years 2 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira