Sciweavers

697 search results - page 69 / 140
» Convex Functions on Discrete Sets
Sort
View
SPAA
1993
ACM
14 years 26 days ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
IJCV
1998
233views more  IJCV 1998»
13 years 8 months ago
A Level-Set Approach to 3D Reconstruction from Range Data
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
Ross T. Whitaker
GIS
2008
ACM
14 years 10 months ago
Finding regional co-location patterns for sets of continuous variables in spatial datasets
This paper proposes a novel framework for mining regional colocation patterns with respect to sets of continuous variables in spatial datasets. The goal is to identify regions in ...
Christoph F. Eick, Jean-Philippe Nicot, Rachana Pa...
ICIP
2004
IEEE
14 years 10 months ago
H-thinning for gray-scale images
Thinnings are very important operators for image analysis developed by mathematical morphology. Their most popular applications are the discrete homotopic skeletons. They are defi...
Sabrina Rami-Shojaei, Corinne Vachier
CAD
2011
Springer
13 years 3 months ago
Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
Ramanathan Muthuganapathy, Gershon Elber, Gill Bar...