Sciweavers

2738 search results - page 183 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 6 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
CVPR
2007
IEEE
16 years 6 months ago
A Variational Approach to the Evolution of Radial Basis Functions for Image Segmentation
In this paper we derive differential equations for evolving radial basis functions (RBFs) to solve segmentation problems. The differential equations result from applying variation...
Greg G. Slabaugh, Huong Quynh Dinh, Gozde B. Unal
CVPR
2008
IEEE
16 years 6 months ago
Smoothing-based Optimization
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
Marius Leordeanu, Martial Hebert
ECCV
2008
Springer
16 years 6 months ago
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
Nikos Komodakis, Nikos Paragios
ICIP
2005
IEEE
16 years 6 months ago
Sampling in practice: is the best reconstruction space bandlimited?
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant " space, ...
Sathish Ramani, Dimitri Van De Ville, Michael Unse...