4541 search results - page 495 / 909 » Cache-Oblivious Algorithms and Data Structures |
186
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
176
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
213
click to vote
WADS
2007
Springer
16 years 13 days ago
2007
Springer
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
161
click to vote
CGI
1998
IEEE
15 years 10 months ago
1998
IEEE
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
179
click to vote
IJCV
2006
15 years 6 months ago
2006
In this paper we address the problem of recovering 3D non-rigid structure from a sequence of images taken with a stereo pair. We have extended existing non-rigid factorization algo...