Sciweavers

699 search results - page 59 / 140
» Generalized Distance Functions in the Theory of Computation
Sort
View
CORR
2007
Springer
93views Education» more  CORR 2007»
14 years 9 months ago
Intrinsic dimension of a dataset: what properties does one expect?
— We propose an axiomatic approach to the concept of an intrinsic dimension of a dataset, based on a viewpoint of geometry of high-dimensional structures. Our first axiom postul...
Vladimir Pestov
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
14 years 1 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
COMPGEOM
2011
ACM
14 years 1 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
15 years 3 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
LICS
2003
IEEE
15 years 3 months ago
Structural Subtyping of Non-Recursive Types is Decidable
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...
Viktor Kuncak, Martin C. Rinard