Sciweavers

6365 search results - page 175 / 1273
» Fast Local Computation Algorithms
Sort
View
143
Voted
FOCS
2000
IEEE
15 years 9 months ago
Computing the Determinant and Smith Form of an Integer Matrix
A probabilistic algorithm is presented to find the determinant of a nonsingular, integer matrix. For a matrix A ¡£¢ n¤ n the algorithm requires O¥ n3¦5 ¥ logn§ 4¦5§ bit...
Wayne Eberly, Mark Giesbrecht, Gilles Villard
WEA
2005
Springer
93views Algorithms» more  WEA 2005»
15 years 10 months ago
From Static Code Distribution to More Shrinkage for the Multiterminal Cut
We present the problem of statically distributing instructions of a common programming language, a problem which we prove equivalent to the multiterminal cut problem. We design e...
Bram De Wachter, Alexandre Genon, Thierry Massart
ICPR
2002
IEEE
16 years 6 months ago
Fast Projection Plane Classifier
In this paper a new approach for classification is presented, the "Fast Projection Plane Classfier", abbreviated here to FPPC. The main idea of FPPC is very simple: A cl...
Dirk Balthasar, Lutz Priese
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
15 years 11 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...
WEA
2009
Springer
165views Algorithms» more  WEA 2009»
15 years 9 months ago
On Computational Models for Flash Memory Devices
Flash memory-based solid-state disks are fast becoming the dominant form of end-user storage devices, partly even replacing the traditional hard-disks. Existing two-level memory hi...
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulric...