Sciweavers

SIAMIS
2010
141views more  SIAMIS 2010»
13 years 5 months ago
Optimization by Stochastic Continuation
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
Marc C. Robini, Isabelle E. Magnin
PAMI
2010
168views more  PAMI 2010»
13 years 9 months ago
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
MAGS
2007
168views more  MAGS 2007»
13 years 10 months ago
Agent-based protein structure prediction
A protein is identified by a finite sequence of amino acids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting...
Luca Bortolussi, Agostino Dovier, Federico Fogolar...
CORR
2006
Springer
127views Education» more  CORR 2006»
13 years 11 months ago
Semi-Supervised Learning -- A Statistical Physics Approach
We present a novel approach to semisupervised learning which is based on statistical physics. Most of the former work in the field of semi-supervised learning classifies the point...
Gad Getz, Noam Shental, Eytan Domany
ISMB
1996
14 years 8 days ago
A Knowledge-Based Method for Protein Structure Refinement and Prediction
The native conformation of a protein, in a given environment, is determined entirely by the various interatomic interactions dictated by the amino acid sequence (1-3). We describe...
Shankar Subramaniam, David K. Tcheng, James M. Fen...
ICCV
2007
IEEE
14 years 5 months ago
On the Extraction of Curve Skeletons using Gradient Vector Flow
In this paper, we propose a new variational framework for computing continuous curve skeletons from discrete objects that are suitable for structural shape representation. We have...
M. Sabry Hassouna, Aly A. Farag
ECCV
2002
Springer
15 years 25 days ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
CVPR
2007
IEEE
15 years 1 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr