777 search results - page 84 / 156 » A fast algorithm for the computation of an upper bound on th... |
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
SI3D
2012
ACM
12 years 3 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 ...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
A method for measuring dissimilarities between cyclic strings is introduced. It computes a weighted mean between two (lower and upper) bounds of the exact cyclic edit distance, wh...