Sciweavers

4137 search results - page 301 / 828
» On the number of matchings of a tree
Sort
View
NGC
2000
Springer
115views Communications» more  NGC 2000»
15 years 10 months ago
Hierarchical reliable multicast
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
Athina Markopoulou, Fouad A. Tobagi
CORR
2010
Springer
81views Education» more  CORR 2010»
15 years 6 months ago
Self-stabilization with Byzantine tolerance for global tasks
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
ASPDAC
2010
ACM
183views Hardware» more  ASPDAC 2010»
15 years 4 months ago
Multi-operand adder synthesis on FPGAs using generalized parallel counters
Multi-operand adders, which are also found in parallel multipliers, usually consist of the compression trees which reduce the number of operands per a bit to two, and the carrypro...
Taeko Matsunaga, Shinji Kimura, Yusuke Matsunaga
ICIC
2009
Springer
15 years 4 months ago
Towards a Better Understanding of Random Forests through the Study of Strength and Correlation
In this paper we present a study on the Random Forest (RF) family of ensemble methods. From our point of view, a "classical" RF induction process presents two main drawba...
Simon Bernard, Laurent Heutte, Sébastien Ad...
MUE
2009
IEEE
252views Multimedia» more  MUE 2009»
16 years 1 months ago
DDoS Detection and Traceback with Decision Tree and Grey Relational Analysis
As modern life becomes increasingly closely bound to the Internet, network security becomes increasingly important. Like it or not, we all live under the shadow of network threats...
Yi-Chi Wu, Huei-Ru Tseng, Wuu Yang, Rong-Hong Jan