104 search results - page 10 / 21 » Dependency trees in sub-linear time and bounded memory |
SI3D
2012
ACM
12 years 4 months ago
2012
ACM
Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting ...
STACS
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
KDD
2000
ACM
14 years 11 days ago
2000
ACM
Many organizations today have more than very large databases; they have databases that grow without limit at a rate of several million records per day. Mining these continuous dat...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...