Sciweavers

2570 search results - page 26 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
CGF
2004
175views more  CGF 2004»
14 years 9 months ago
DiFi: Fast 3D Distance Field Computation Using Graphics Hardware
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
Avneesh Sud, Miguel A. Otaduy, Dinesh Manocha
WAW
2004
Springer
124views Algorithms» more  WAW 2004»
15 years 3 months ago
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)
ystem (Extended Abstract) Gianna M. Del Corso1 Antonio Gull´ı1,2 Francesco Romani1 1 Dipartimento di Informatica, University of Pisa, Italy 2 IIT-CNR, Pisa
Gianna M. Del Corso, Antonio Gulli, Francesco Roma...
IPL
2011
91views more  IPL 2011»
14 years 1 months ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...