Sciweavers

288 search results - page 1 / 58
» Notes on computing minimal approximant bases
Sort
View
MIRAGE
2007
Springer
13 years 11 months ago
A Note on the Discrete Binary Mumford-Shah Model
Abstract. This paper is concerned itself with the analysis of the twophase Mumford-Shah model also known as the active contour without edges model introduced by Chan and Vese. It c...
Jérôme Darbon
SCL
2008
109views more  SCL 2008»
13 years 4 months ago
A note on linear function approximation using random projections
ABSTRACT: Linear function approximations based on random projections are proposed and justified for a class of fixed point and minimization problems. KEY WORDS: random projections,...
Kishor Barman, Vivek S. Borkar
IPPS
2008
IEEE
13 years 11 months ago
Optimal spot-checking to minimize the computation time in volunteer computing
This paper proposes an optimization technique for spotchecking to minimize the computation time of volunteer computing (VC) systems with malicious participants who return erroneou...
Kan Watanabe, Masaru Fukushi, Susumu Horiguchi
CVPR
2010
IEEE
14 years 29 days ago
Fast Approximate Energy Minimization with Label Costs
The α-expansion algorithm [4] has had a significant impact in computer vision due to its generality, effectiveness, and speed. Thus far it can only minimize energies that involv...
Andrew Delong, Anton Osokin, Hossam Isack, Yuri Bo...