4565 search results - page 801 / 913 » Time Optimal Self-Stabilizing Algorithms |
EGH
2010
Springer
13 years 8 months ago
2010
Springer
The k-D tree is a well-studied acceleration data structure for ray tracing. It is used to organize primitives in a scene to allow efficient execution of intersection operations be...
ICDE
2010
IEEE
14 years 10 months ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
ASPDAC
2009
ACM
14 years 4 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
ICRA
1999
IEEE
14 years 2 months ago
1999
IEEE
The mobile robot localization problem is decomposed into two stages attitude estimation followed by position estimation. The innovation of our method is the use of a smoother, in ...
ATAL
2003
Springer
14 years 3 months ago
2003
Springer
Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Reques...