427 search results - page 54 / 86 » Computing the Local Consensus of Trees |
149
click to vote
SIAMSC
2011
14 years 7 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
147
click to vote
AAAI
2004
15 years 6 months ago
2004
Object recognition and detection represent a relevant component in cognitive computer vision systems, such as in robot vision, intelligent video surveillance systems, or multi-mod...
201
click to vote
PPOPP
2010
ACM
16 years 1 months ago
2010
ACM
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
137
click to vote
SPAA
1997
ACM
15 years 8 months ago
1997
ACM
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
105
click to vote
PODC
2003
ACM
15 years 9 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...