4047 search results - page 499 / 810 » The Discrete Basis Problem |
141
Voted
COMPGEOM
2007
ACM
15 years 9 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
150
click to vote
COMPGEOM
2010
ACM
15 years 9 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...
143
click to vote
SIGGRAPH
1995
ACM
15 years 8 months ago
1995
ACM
Physically-based modeling has been used in the past to support a variety of interactive modeling tasks including free-form surface design, mechanism design, constrained drawing, a...
145
Voted
NIPS
2007
15 years 6 months ago
2007
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
169
Voted
BMCBI
2008
15 years 5 months ago
2008
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...