Sciweavers

470 search results - page 50 / 94
» Local properties of geometric graphs
Sort
View
MST
2010
187views more  MST 2010»
13 years 2 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda
CSL
2007
Springer
14 years 1 months ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 6 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
CVPR
2008
IEEE
14 years 9 months ago
Clustering and dimensionality reduction on Riemannian manifolds
We propose a novel algorithm for clustering data sampled from multiple submanifolds of a Riemannian manifold. First, we learn a representation of the data using generalizations of...
Alvina Goh, René Vidal
JMIV
2006
133views more  JMIV 2006»
13 years 7 months ago
Combining Seminorms in Adaptive Lifting Schemes and Applications to Image Analysis and Compression
In this paper, we present some adaptive wavelet decompositions that can capture the directional nature of images. Our method exploits the properties of seminorms to build lifting s...
Gemma Piella, Béatrice Pesquet-Popescu, Hen...