9659 search results - page 354 / 1932 » Points on Computable Curves |
223
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
143
click to vote
COLCOM
2005
IEEE
16 years 15 days ago
2005
IEEE
Effective interaction among participants is crucial to the success of a presentation. The workspace of a presentation, which is the presentation slides, is a natural and effective...
156
click to vote
SWAT
2004
Springer
16 years 7 days ago
2004
Springer
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
194
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
185
click to vote
VMV
2007
15 years 8 months ago
2007
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...