Sciweavers

730 search results - page 42 / 146
» Combinatorics of Monotone Computations
Sort
View
ICIP
2001
IEEE
14 years 10 months ago
A comparative evaluation of algorithms for fast computation of level set PDEs with applications to motion segmentation
We address the problem of fast computation of level set partial differential equations (PDEs) in the context of motion segmentation. Although several fast level set computation al...
Abdol-Reza Mansouri, Thierry Chomaud, Janusz Konra...
LFP
1992
78views more  LFP 1992»
13 years 10 months ago
A Syntactic Approach to Fixed Point Computation on Finite Domains
We propose a syntactic approach to performing fixed point computation on finite domains. Finding fixed points in finite domains for monotonic functions is an essential task when c...
Tyng-Ruey Chuang, Benjamin Goldberg
CORR
2010
Springer
119views Education» more  CORR 2010»
13 years 7 months ago
Computational Complexity of Avalanches in the Kadanoff two-dimensional Sandpile Model
In this paper we prove that the avalanche problem for the Kadanoff sandpile model (KSPM) is P-complete for two-dimensions. Our proof is based on a reduction from the monotone circ...
Eric Goles Chacc, Bruno Martin
SIAMNUM
2010
126views more  SIAMNUM 2010»
13 years 3 months ago
Smoothing under Diffeomorphic Constraints with Homeomorphic Splines
In this paper we introduce a new class of diffeomorphic smoothers based on general spline smoothing techniques and on the use of some tools that have been recently developed in th...
Jérémie Bigot, Sébastien Gada...
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 10 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan