Sciweavers

1809 search results - page 230 / 362
» Weakly Computable Real Numbers
Sort
View
ICALP
2004
Springer
14 years 3 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson
VVS
1996
IEEE
129views Visualization» more  VVS 1996»
14 years 2 months ago
Optimal Isosurface Extraction from Irregular Volume Data
A method is proposed which supports the extraction of isosurfaces from irregular volume data, represented by tetrahedral decomposition, in optimal time. The method is based on a d...
Paolo Cignoni, Claudio Montani, Enrico Puppo, Robe...
ICALP
1992
Springer
14 years 2 months ago
Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
Bernard Chazelle, Burton Rosenberg
ACCV
2007
Springer
14 years 2 months ago
Efficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
ACMICEC
2007
ACM
127views ECommerce» more  ACMICEC 2007»
14 years 2 months ago
Decentralized task allocation using magnet: an empirical evaluation in the logistics domain
This paper presents a decentralized task allocation method that can handle allocation of tasks with time and precedence constraints in a multi-agent setting where not all informat...
Mark Hoogendoorn, Maria L. Gini, Catholijn M. Jonk...