Sciweavers

2200 search results - page 180 / 440
» Bloch's Constant is Computable
Sort
View
COMGEO
2010
ACM
15 years 6 months ago
Pointed binary encompassing trees: Simple and optimal
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Active Learning by Spherical Subdivision
We introduce a computationally feasible, "constructive" active learning method for binary classification. The learning algorithm is initially formulated for separable cl...
Falk-Florian Henrich, Klaus Obermayer
CGF
2005
99views more  CGF 2005»
15 years 6 months ago
N-Buffers for efficient depth map query
We introduce the N-buffer as a tool for multiresolution depth map representation. This neighborhood buffer encodes the value and position of local depth extrema at different scale...
Xavier Décoret
CORR
2004
Springer
86views Education» more  CORR 2004»
15 years 6 months ago
Pandora : une plate-forme efficace pour la construction d'applications autonomes
Autonomic computing has been proposed recently as a way to address the difficult management of applications whose complexity is constantly increasing. Autonomous applications will ...
Simon Patarin, Mesaac Makpangou
CG
2000
Springer
15 years 6 months ago
Light propagation visualization as a tool for 3D scene analysis in lighting design
This paper is devoted to a designer tool, which is an extension of particle tracing algorithm for analysis of scenes, artifacts, image ghosts, and ray tracing mechanism itself. Th...
Edward A. Kopylov, Kirill Dmitriev