3244 search results - page 443 / 649 » On convex complexity measures |
155
click to vote
MOBIHOC
2004
ACM
16 years 6 months ago
2004
ACM
APS algorithms use the basic idea of distance vector routing to find positions in an ad hoc network using only a fraction of landmarks, for example GPS enabled nodes. All the node...
132
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
We study the performance of three parallel algorithms and their hybrid variants for solving tridiagonal linear systems on a GPU: cyclic reduction (CR), parallel cyclic reduction (...
170
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
Adaptive, or self-aware, computing has been proposed to help application programmers confront the growing complexity of multicore software development. However, existing approache...
177
click to vote
Publication
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we p...
172
click to vote
EUROSYS
2007
ACM
16 years 3 months ago
2007
ACM
Software transactional memory (STM) is a promising technique for controlling concurrency in modern multi-processor architectures. STM aims to be more scalable than explicit coarse...