Sciweavers

4536 search results - page 517 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
16 years 6 days ago
Dynamic Tree Cross Products
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, ...
Marcus Raitner
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
16 years 28 days ago
Approximate Range Searching: The Absolute Model
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 ε >...
Guilherme Dias da Fonseca
CGI
1998
IEEE
15 years 11 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
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...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
PPSN
1994
Springer
15 years 11 months ago
RPL2: A Language and Parallel Framework for Evolutionary Computing
The Reproductive Plan Language 2 (RPL2) is an extensible interpreted language for writing and using evolutionary computing programs. It supports arbitrary genetic representations,...
Patrick D. Surry, Nicholas J. Radcliffe
IJCV
2006
261views more  IJCV 2006»
15 years 6 months ago
Non-Rigid Stereo Factorization
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...
Alessio Del Bue, Lourdes de Agapito