Sciweavers

2252 search results - page 164 / 451
» Improving Random Forests
Sort
View
TWC
2008
98views more  TWC 2008»
13 years 8 months ago
On bandwidth request mechanism with piggyback in fixed IEEE 802.16 networks
This paper investigates the random channel access mechanism specified in the IEEE 802.16 standard for the uplink traffic in a Point-to-MultiPoint (PMP) network architecture. An ana...
Jianhua He, Kun Yang, Ken Guild, Hsiao-Hwa Chen
COMBINATORICA
2004
79views more  COMBINATORICA 2004»
13 years 8 months ago
The Deletion Method For Upper Tail Estimates
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...
Svante Janson, Andrzej Rucinski
RECOMB
2005
Springer
14 years 8 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
PPOPP
2010
ACM
14 years 5 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
ICALP
2010
Springer
14 years 1 months ago
Thresholded Covering Algorithms for Robust and Max-min Optimization
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
Anupam Gupta, Viswanath Nagarajan, R. Ravi