356 search results - page 30 / 72 » Pairwise Cardinality Networks |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
NIPS
2004
13 years 9 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We present a novel approach to embedding data represented by a network into a lowdimensional Euclidean space. Unlike existing methods, the proposed method attempts to minimize an ...
ICCV
2003
IEEE
14 years 9 months ago
2003
IEEE
A Bayesian network formulation for relational shape matching is presented. The main advantage of the relational shape matching approach is the obviation of the non-rigid spatial m...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Distributed computing must adapt its techniques to networks of mobile agents. Indeed, we are facing new problems like the small size of memory and the lack of computation...