Sciweavers

Share
24 search results - page 1 / 5
» Distributed Almost Exact Approximations for Minor-Closed Fam...
Sort
View
ESA
2006
Springer
95views Algorithms» more  ESA 2006»
9 years 2 months ago
Distributed Almost Exact Approximations for Minor-Closed Families
Andrzej Czygrinow, Michal Hanckowiak
COCOON
2007
Springer
9 years 4 months ago
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
Andrzej Czygrinow, Michal Hanckowiak
ISAAC
2003
Springer
125views Algorithms» more  ISAAC 2003»
9 years 3 months ago
A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
FTDB
2011
98views more  FTDB 2011»
8 years 1 months ago
Secure Distributed Data Aggregation
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
ICML
2008
IEEE
9 years 11 months ago
Training restricted Boltzmann machines using approximations to the likelihood gradient
A new algorithm for training Restricted Boltzmann Machines is introduced. The algorithm, named Persistent Contrastive Divergence, is different from the standard Contrastive Diverg...
Tijmen Tieleman
books