Sciweavers

417 search results - page 20 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
ISBI
2004
IEEE
14 years 9 months ago
Diffusion Smoothing on Brain Surface via Finite Element Method
Surface data such as the segmented cortical surface of the human brain plays an important role in medical imaging. To increase the signal-to-noise ratio for data residing on the b...
Moo Chung, Jonathan Taylor
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 8 months ago
LSMR: An iterative algorithm for sparse least-squares problems
Abstract. An iterative method LSMR is presented for solving linear systems Ax = b and leastsquares problem min Ax - b 2, with A being sparse or a fast linear operator. LSMR is base...
David Fong, Michael Saunders
JSCIC
2008
79views more  JSCIC 2008»
13 years 8 months ago
A New Ghost Cell/Level Set Method for Moving Boundary Problems: Application to Tumor Growth
Abstract In this paper, we present a ghost cell/level set method for the evolution of interfaces whose normal velocity depend upon the solutions of linear and nonlinear quasi-stead...
Paul Macklin, John Lowengrub
ICML
2006
IEEE
14 years 9 months ago
Fast direct policy evaluation using multiscale analysis of Markov diffusion processes
Policy evaluation is a critical step in the approximate solution of large Markov decision processes (MDPs), typically requiring O(|S|3 ) to directly solve the Bellman system of |S...
Mauro Maggioni, Sridhar Mahadevan
CSCLP
2007
Springer
14 years 2 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth