1068 search results - page 155 / 214 » Extremely randomized trees |
ICCAD
2002
IEEE
14 years 6 months ago
2002
IEEE
We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduc...
ICALP
2005
Springer
14 years 3 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
HSNMC
2004
Springer
14 years 3 months ago
2004
Springer
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
COLT
2001
Springer
14 years 2 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...