Sciweavers

5658 search results - page 6 / 1132
» An Efficient Counting Network
Sort
View
SIGMOD
2005
ACM
106views Database» more  SIGMOD 2005»
14 years 10 months ago
Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams
Existing energy-efficient approaches to in-network aggregation in sensor networks can be classified into two categories, tree-based and multi-path-based, with each having unique s...
Amit Manjhi, Suman Nath, Phillip B. Gibbons
PODC
1993
ACM
14 years 1 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ACL
2006
13 years 11 months ago
Sub-Sentential Alignment Using Substring Co-Occurrence Counts
In this paper, we will present an efficient method to compute the co-occurrence counts of any pair of substring in a parallel corpus, and an algorithm that make use of these count...
Fabien Cromierès
TIT
2008
83views more  TIT 2008»
13 years 9 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck