Sciweavers

340 search results - page 31 / 68
» Efficient algorithms for bichromatic separability
Sort
View
ETVC
2008
14 years 11 months ago
Intrinsic Geometries in Learning
In a seminal paper, Amari (1998) proved that learning can be made more efficient when one uses the intrinsic Riemannian structure of the algorithms' spaces of parameters to po...
Richard Nock, Frank Nielsen
61
Voted
JSCIC
2008
58views more  JSCIC 2008»
14 years 9 months ago
A Local Semi-Implicit Level-Set Method for Interface Motion
Abstract This paper proposes and implements a novel hybrid level set method which combines the numerical efficiency of the local level set approach with the temporal stability affo...
David Salac, Wei Lu
SIAMSC
2008
188views more  SIAMSC 2008»
14 years 9 months ago
Adaptivity with Dynamic Meshes for Space-Time Finite Element Discretizations of Parabolic Equations
In this paper, we develop an error estimator and an adaptive algorithm for efficient solution of parabolic partial differential equations. The error estimator assesses the discreti...
Michael Schmich, Boris Vexler
ICTAC
2010
Springer
14 years 7 months ago
Mechanized Verification with Sharing
We consider software verification of imperative programs by theorem proving in higher-order separation logic. Of particular interest are the difficulties of encoding and reasoning ...
J. Gregory Malecha, Greg Morrisett
ECCV
2002
Springer
15 years 11 months ago
DEFORMOTION: Deforming Motion, Shape Average and the Joint Registration and Segmentation of Images
What does it mean for a deforming object to be "moving" (see Fig. 1)? How can we separate the overall motion (a finite-dimensional group action) from the more general de...
Stefano Soatto, Anthony J. Yezzi