Sciweavers

2252 search results - page 300 / 451
» Improving Random Forests
Sort
View
86
Voted
COCOON
2009
Springer
15 years 7 months ago
On Smoothed Analysis of Quicksort and Hoare's Find
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Ni...
84
Voted
P2P
2008
IEEE
124views Communications» more  P2P 2008»
15 years 7 months ago
A Bandwidth-Aware Scheduling Strategy for P2P-TV Systems
P2P-TV systems distribute live streaming contents by organizing the information flow in small chunks that are exchanged among peers. Different strategies can be implemented at th...
Ana Paula Couto da Silva, Emilio Leonardi, Marco M...
GLOBECOM
2007
IEEE
15 years 7 months ago
Beamforming with Limited Feedback in Amplify-and-Forward Cooperative Networks
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
Yi Zhao, Raviraj Adve, Teng Joon Lim
INFOCOM
2007
IEEE
15 years 7 months ago
Reliable Broadcast in Wireless Networks with Probabilistic Failures
We consider the problem of reliable broadcast in a wireless network in which nodes are prone to failure. In the failure mode considered in this paper, each node can fail independe...
Vartika Bhandari, Nitin H. Vaidya
P2P
2007
IEEE
15 years 7 months ago
A Data Placement Scheme with Time-Related Model for P2P Storages
Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods a...
Jing Tian, Zhi Yang, Yafei Dai