Sciweavers

944 search results - page 2 / 189
» A Survey on Counting Networks
Sort
View
PODC
1993
ACM
13 years 11 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
ICDM
2002
IEEE
448views Data Mining» more  ICDM 2002»
13 years 12 months ago
Feature Selection Algorithms: A Survey and Experimental Evaluation
In view of the substantial number of existing feature selection algorithms, the need arises to count on criteria that enables to adequately decide which algorithm to use in certai...
Luis Carlos Molina, Lluís Belanche, À...
P2P
2009
IEEE
103views Communications» more  P2P 2009»
14 years 1 months ago
Towards Robust Peer Counting
Abstract—This paper describes T-SIZE, a peer counting protocol that is based on gossip-based aggregation. Peer counting has become increasingly important as the size of the netwo...
Alberto Montresor, Ali Ghodsi
IPPS
1999
IEEE
13 years 11 months ago
An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic
We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge s...
Rong Lin, Koji Nakano, Stephan Olariu, Albert Y. Z...