Sciweavers

3049 search results - page 385 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
MICCAI
2010
Springer
15 years 2 months ago
Extraction of the Plane of Minimal Cross-Sectional Area of the Corpus Callosum Using Template-Driven Segmentation
Abstract. Changes in corpus callosum (CC) size are typically quantified in clinical studies by measuring the CC cross-sectional area on a midsagittal plane. We propose an alternati...
Neda Changizi, Ghassan Hamarneh, Omer Ishaq, Aaron...
JSCIC
2010
101views more  JSCIC 2010»
14 years 11 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 8 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
AI
2010
Springer
15 years 4 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
WADS
2005
Springer
132views Algorithms» more  WADS 2005»
15 years 10 months ago
k-Link Shortest Paths in Weighted Subdivisions
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...