Sciweavers

7943 search results - page 1547 / 1589
» A calculus for costed computations
Sort
View
USS
2008
15 years 10 days ago
On Auditing Elections When Precincts Have Different Sizes
We address the problem of auditing an election when precincts may have different sizes. Prior work in this field has emphasized the simpler case when all precincts have the same s...
Javed A. Aslam, Raluca A. Popa, Ronald L. Rivest
ASPLOS
2008
ACM
15 years 1 days ago
General and efficient locking without blocking
Standard concurrency control mechanisms offer a trade-off: Transactional memory approaches maximize concurrency, but suffer high overheads and cost for retrying in the case of act...
Yannis Smaragdakis, Anthony Kay, Reimer Behrends, ...
ATAL
2008
Springer
15 years 1 days ago
Decentralised coordination of low-power embedded devices using the max-sum algorithm
This paper considers the problem of performing decentralised coordination of low-power embedded devices (as is required within many environmental sensing and surveillance applicat...
Alessandro Farinelli, Alex Rogers, Adrian Petcu, N...
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
14 years 12 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
CPM
2008
Springer
134views Combinatorics» more  CPM 2008»
14 years 11 months ago
An Improved Succinct Representation for Dynamic k-ary Trees
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Diego Arroyuelo
« Prev « First page 1547 / 1589 Last » Next »