432 search results - page 54 / 87 » Internally deterministic parallel algorithms can be fast |
122
Voted
ALT
2010
Springer
15 years 3 months ago
2010
Springer
: The ability to distinguish, differentiate and contrast between different data sets is a key objective in data mining. Such ability can assist domain experts to understand their d...
98
Voted
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
We propose a concurrent relaxed balance AVL tree algorithm that is fast, scales well, and tolerates contention. It is based on optimistic techniques adapted from software transact...
123
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
142
Voted
SRDS
2010
IEEE
14 years 11 months ago
2010
IEEE
Data aggregation scheduling, or convergecast, is a fundamental pattern of communication in wireless sensor networks (WSNs), where sensor nodes aggregate and relay data to a sink no...
121
Voted
ICDCS
1998
IEEE
15 years 6 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...