1419 search results - page 125 / 284 » A Characterization of Constructive Dimension |
146
Voted
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
115
click to vote
PR
2007
15 years 4 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
149
Voted
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
126
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
A representative subspace is significant for image analysis, while the corresponding techniques often suffer from the curse of dimensionality dilemma. In this paper, we propose a ...
129
click to vote
VIS
2007
IEEE
16 years 5 months ago
2007
IEEE
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...