4486 search results - page 381 / 898 » Adaptable Boundary Sets |
224
click to vote
EMMCVPR
2003
Springer
16 years 25 days ago
2003
Springer
This paper presents a novel method for surface recovery from discrete 3D point data sets. In order to produce improved reconstruction results, the algorithm presented in this paper...
175
click to vote
COCO
2010
Springer
15 years 11 months ago
2010
Springer
—In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK . It was previously known that PSPACE, and hence BPP is Turingreducible to RK ...
220
click to vote
NIPS
2004
15 years 9 months ago
2004
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
249
click to vote
EGPGV
2004
Springer
16 years 1 months ago
2004
Springer
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...
191
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...