Sciweavers

2252 search results - page 283 / 451
» Improving Random Forests
Sort
View
INFOCOM
2005
IEEE
15 years 6 months ago
Network coding for large scale content distribution
— We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate...
Christos Gkantsidis, Pablo Rodriguez
94
Voted
IPPS
2005
IEEE
15 years 6 months ago
MaTCH : Mapping Data-Parallel Tasks on a Heterogeneous Computing Platform Using the Cross-Entropy Heuristic
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
Soumya Sanyal, Sajal K. Das
107
Voted
ISCC
2005
IEEE
15 years 6 months ago
Degree-Optimal Deterministic Routing for P2P Systems
We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
METRICS
2005
IEEE
15 years 6 months ago
An Empirical Analysis of Software Productivity over Time
OBJECTIVE - the aim is to investigate how software project productivity has changed over time. Within this overall goal we also compare productivity between different business sec...
Rahul Premraj, Martin J. Shepperd, Barbara A. Kitc...
127
Voted
SASN
2005
ACM
15 years 6 months ago
A key pre-distribution scheme for secure sensor networks using probability density function of node deployment
Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Rec...
Takashi Ito, Hidenori Ohta, Nori Matsuda, Takeshi ...