Sciweavers

2593 search results - page 73 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
TPDS
2010
135views more  TPDS 2010»
15 years 26 days ago
Maximizing Service Reliability in Distributed Computing Systems with Random Node Failures: Theory and Implementation
—In distributed computing systems (DCSs) where server nodes can fail permanently with nonzero probability, the system performance can be assessed by means of the service reliabil...
Jorge E. Pezoa, Sagar Dhakal, Majeed M. Hayat
106
Voted
IPMI
2007
Springer
16 years 3 months ago
Bayesian Tracking of Elongated Structures in 3D Images
Tracking of tubular elongated structures is an important goal in a wide range of biomedical imaging applications. A Bayesian tube tracking algorithm is presented that allows to eas...
Michiel Schaap, Ihor Smal, Coert Metz, Theo van Wa...
COMPGEOM
2010
ACM
15 years 7 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
ISVC
2007
Springer
15 years 8 months ago
Fast kd -Tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Many computer graphics rendering algorithms and techniques use ray tracing for generation of natural and photo-realistic images. The efficiency of the ray tracing algorithms depend...
Sajid Hussain, Håkan Grahn
COMPGEOM
2008
ACM
15 years 4 months ago
Self-improving algorithms for delaunay triangulations
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
Kenneth L. Clarkson, C. Seshadhri