Sciweavers

123 search results - page 2 / 25
» A sampling theory for compact sets in Euclidean space
Sort
View
CSL
2010
Springer
13 years 6 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
JAT
2010
80views more  JAT 2010»
13 years 3 months ago
The Bregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator Π g C and the relative projection operator P g C in...
Chong Li, Wen Song, Jen-Chih Yao
ICIP
2008
IEEE
14 years 6 months ago
On the estimation of geodesic paths on sampled manifolds under random projections
In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in highdimensional Euclidean spaces. We show that geodesic paths ...
Mona Mahmoudi, Pierre Vandergheynst, Matteo Sorci
FOCM
2010
160views more  FOCM 2010»
13 years 3 months ago
Boundary Measures for Geometric Inference
We study the boundary measures of compact subsets of the d-dimensional Euclidean space, which are closely related to Federer’s curvature measures. We show that they can be comput...
Frédéric Chazal, David Cohen-Steiner...
STOC
1989
ACM
99views Algorithms» more  STOC 1989»
13 years 9 months ago
A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
Martin E. Dyer, Alan M. Frieze, Ravi Kannan