Sciweavers

909 search results - page 62 / 182
» On the approximability of some network design problems
Sort
View
INTERNET
2006
157views more  INTERNET 2006»
15 years 6 months ago
Distributed Data Mining in Peer-to-Peer Networks
Distributed data mining deals with the problem of data analysis in environments with distributed data, computing nodes, and users. Peer-to-peer computing is emerging as a new dist...
Souptik Datta, Kanishka Bhaduri, Chris Giannella, ...
ESANN
2003
15 years 7 months ago
Neural networks organizations to learn complex robotic functions
Abstract. This paper considers the general problem of function estimation with a modular approach of neural computing. We propose to use functionally independent subnetworks to lea...
Gilles Hermann, Patrice Wira, Jean-Philippe Urban
COMPGEOM
2004
ACM
15 years 11 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
DSN
2011
IEEE
14 years 6 months ago
Resource and virtualization costs up in the cloud: Models and design choices
—Virtualization offers the potential for cost-effective service provisioning. For service providers who make significant investments in new virtualized data centers in support of...
Daniel Gmach, Jerry Rolia, Ludmila Cherkasova
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal