Sciweavers

697 search results - page 15 / 140
» Convex Functions on Discrete Sets
Sort
View
PAMI
2006
111views more  PAMI 2006»
13 years 8 months ago
Global Segmentation and Curvature Analysis of Volumetric Data Sets Using Trivariate B-Spline Functions
This paper presents a method to globally segment volumetric images into regions that contain convex or concave (elliptic) iso-surfaces, planar or cylindrical (parabolic) iso-surfa...
Octavian Soldea, Gershon Elber, Ehud Rivlin
EOR
2007
113views more  EOR 2007»
13 years 9 months ago
Duality for location problems with unbounded unit balls
Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
Gert Wanka, Radu Ioan Bot, Emese Vargyas
COMPGEOM
2011
ACM
13 years 15 days ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
FOCS
2007
IEEE
14 years 3 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
DIMACS
2001
13 years 10 months ago
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
Thorsten Theobald