Sciweavers

234 search results - page 7 / 47
» Randomized splay trees: Theoretical and experimental results
Sort
View
INFOCOM
2000
IEEE
15 years 3 months ago
A Modular Approach to Packet Classification: Algorithms and Results
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...
Thomas Y. C. Woo
101
Voted
OPODIS
2007
15 years 1 months ago
Small-World Networks: From Theoretical Bounds to Practical Systems
Abstract. In small-world networks, each peer is connected to its closest neighbors in the network topology, as well as to additional long-range contact(s), also called shortcut(s)....
François Bonnet, Anne-Marie Kermarrec, Mich...
ICIP
2010
IEEE
14 years 9 months ago
Building Emerging Pattern (EP) Random forest for recognition
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
Liang Wang, Yizhou Wang, Debin Zhao
JNCA
2011
281views more  JNCA 2011»
14 years 2 months ago
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
  Recently, several studies have been conducted to design mobility‐based multicast routing protocols for    wireless mobile ad hoc networks (MANET). These ...
Javad Akbari Torkestani, Mohammad Reza Meybodi
CP
1998
Springer
15 years 3 months ago
Random Constraint Satisfaction: Theory Meets Practice
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
Ewan MacIntyre, Patrick Prosser, Barbara M. Smith,...