Sciweavers

1725 search results - page 51 / 345
» Relaxed genetic programming
Sort
View
EMMCVPR
2005
Springer
15 years 4 months ago
Probabilistic Subgraph Matching Based on Convex Relaxation
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
Christian Schellewald, Christoph Schnörr
ICRA
1998
IEEE
142views Robotics» more  ICRA 1998»
15 years 3 months ago
Lagrangian Relaxation Neural Networks for Job Shop Scheduling
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
Peter B. Luh, Xing Zhao, Yajun Wang
TIT
2011
209views more  TIT 2011»
14 years 6 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
ICML
2008
IEEE
16 years 4 days ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
CSB
2005
IEEE
118views Bioinformatics» more  CSB 2005»
15 years 5 months ago
Gene Teams with Relaxed Proximity Constraint
Functionally related genes co-evolve, probably due to the strong selection pressure in evolution. Thus we expect that they are present in multiple genomes. Physical proximity amon...
Sun Kim, Jeong-Hyeon Choi, Jiong Yang