Sciweavers

2252 search results - page 179 / 451
» Improving Random Forests
Sort
View
122
Voted
PODC
2003
ACM
15 years 7 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
106
Voted
EUROCRYPT
2003
Springer
15 years 7 months ago
Nearly One-Sided Tests and the Goldreich-Levin Predicate
Abstract. We study statistical tests with binary output that rarely outputs one, which we call nearly one-sided statistical tests. We provide an efficient reduction establishing im...
Gustav Hast
102
Voted
WABI
2001
Springer
15 years 7 months ago
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
We study the convergence rates of neighbor-joining and several new phylogenetic reconstruction methods on families of trees of bounded diameter. Our study presents theoretically ob...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
110
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
Blocking in All-Optical Networks
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
Ashwin Sridharan, Kumar N. Sivarajan
115
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
On the Aggregatability of Multicast Forwarding State
Abstract— It has been claimed that multicast state cannot be aggregated. In this paper, we will debunk this myth and present a simple technique that can be used to aggregate mult...
David Thaler, Mark Handley