674 search results - page 78 / 135 » The computational complexity of the parallel knock-out probl... |
104
click to vote
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
104
click to vote
ICVS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
121
click to vote
MIDDLEWARE
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. The trend towards cloud and utility computing infrastructures raises challenges not only for application development, but also for management: diverse resources, changing...
124
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstract. LAPACK90 is a set of LAPACK90 subroutines which interfaces FORTRAN90 with LAPACK. All LAPACK driver subroutines including expert drivers and some LAPACK computationals ha...
124
click to vote
PDCAT
2009
Springer
15 years 8 months ago
2009
Springer
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...