Sciweavers

102291 search results - page 349 / 20459
» Computability in Computational Geometry
Sort
View
NIPS
2000
15 years 8 months ago
Incremental and Decremental Support Vector Machine Learning
An on-line recursive algorithm for training support vector machines, one vector at a time, is presented. Adiabatic increments retain the KuhnTucker conditions on all previously se...
Gert Cauwenberghs, Tomaso Poggio
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 6 months ago
Polygon Exploration with Discrete Vision
With the advent of autonomous robots with two- and three-dimensional scanning capabilities, classical visibility-based exploration methods from computational geometry have gained ...
Sándor P. Fekete, Christiane Schmidt
CGF
2005
141views more  CGF 2005»
15 years 6 months ago
Survey of Real-Time Rendering Techniques for Crowds
Real-time rendering of photo-realistic humans is considerably outside the scope of current consumer-level computer hardware. There are many techniques, which attempt to bridge the...
G. Ryder, A. M. Day
ALGORITHMICA
1998
111views more  ALGORITHMICA 1998»
15 years 6 months ago
A Note on Point Location in Delaunay Triangulations of Random Points
This short note considers the problem of point location in a Delaunay triangulation of n random points, using no additional preprocessing or storage other than a standard data stru...
Luc Devroye, Ernst P. Mücke, Binhai Zhu
IPL
2002
107views more  IPL 2002»
15 years 6 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
Sunil Arya
« Prev « First page 349 / 20459 Last » Next »