Sciweavers

1480 search results - page 198 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
203
Voted
SPAA
2012
ACM
13 years 3 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
109
Voted
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
15 years 2 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
106
Voted
TSMC
2010
14 years 7 months ago
Probability Density Estimation With Tunable Kernels Using Orthogonal Forward Regression
A generalized or tunable-kernel model is proposed for probability density function estimation based on an orthogonal forward regression procedure. Each stage of the density estimat...
Sheng Chen, Xia Hong, Chris J. Harris
SIGIR
2006
ACM
15 years 6 months ago
Large scale semi-supervised linear SVMs
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...
Vikas Sindhwani, S. Sathiya Keerthi
PODC
2004
ACM
15 years 6 months ago
Compact routing on euclidian metrics
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
Ittai Abraham, Dahlia Malkhi