Sciweavers

1068 search results - page 62 / 214
» Extremely randomized trees
Sort
View
INFOCOM
2007
IEEE
14 years 3 months ago
Tree, Segment Table, and Route Bucket: A Multi-Stage Algorithm for IPv6 Routing Table Lookup
—Next generation internet protocol, IPv6, has attracted growing attention and has been deploying worldwide. With 128-bit address, IPv6 provides an extremely large address space a...
Zhenqiang Li, Dongqu Zheng, Yan Ma
IPPS
2007
IEEE
14 years 3 months ago
Power-Aware Routing for Well-Nested Communications On The Circuit Switched Tree
Although algorithms that employ dynamic reconfiguration are extremely fast, they need the underlying architecture to change structure very rapidly, possibly at each step of the c...
Hatem M. El-Boghdadi
INFOSCALE
2007
ACM
13 years 10 months ago
SDI: a swift tree structure for multi-dimensional data indexing in peer-to-peer networks
Efficient multi-dimensional data search has received much attention in centralized systems. However, its implementation in large-scale distributed systems is not a trivial job and...
Rong Zhang, Weining Qian, Minqi Zhou, Aoying Zhou
TMA
2010
Springer
137views Management» more  TMA 2010»
13 years 6 months ago
K-Dimensional Trees for Continuous Traffic Classification
Abstract. The network measurement community has proposed multiple machine learning (ML) methods for traffic classification during the last years. Although several research works ha...
Valentín Carela-Español, Pere Barlet...
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 8 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...