Sciweavers

1446 search results - page 172 / 290
» Simple network performance tomography
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
14 years 3 days ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CN
2008
117views more  CN 2008»
13 years 8 months ago
Broker-placement in latency-aware peer-to-peer networks
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
Pawel Garbacki, Dick H. J. Epema, Maarten van Stee...
ICML
2007
IEEE
14 years 9 months ago
An empirical evaluation of deep architectures on problems with many factors of variation
Recently, several learning algorithms relying on models with deep architectures have been proposed. Though they have demonstrated impressive performance, to date, they have only b...
Hugo Larochelle, Dumitru Erhan, Aaron C. Courville...
ICML
2008
IEEE
14 years 9 months ago
Classification using discriminative restricted Boltzmann machines
Recently, many applications for Restricted Boltzmann Machines (RBMs) have been developed for a large variety of learning problems. However, RBMs are usually used as feature extrac...
Hugo Larochelle, Yoshua Bengio
ALT
2009
Springer
14 years 5 months ago
Learning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...