2093 search results - page 173 / 419 » Statistical Point Geometry |
155
click to vote
CGF
2000
15 years 3 months ago
2000
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
157
click to vote
COMGEO
1999
ACM
15 years 3 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
124
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
104
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
The dynamic hierarchical Dirichlet process (dHDP) is developed to model the timeevolving statistical properties of sequential data sets. The data collected at any time point are r...
119
click to vote
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...