Sciweavers

289 search results - page 13 / 58
» Node similarity in the citation graph
Sort
View
APPROX
2006
Springer
117views Algorithms» more  APPROX 2006»
13 years 11 months ago
Fractional Matching Via Balls-and-Bins
In this paper we relate the problem of finding structures related to perfect matchings in bipartite graphs to a stochastic process similar to throwing balls into bins. Given a bip...
Rajeev Motwani, Rina Panigrahy, Ying Xu 0002
PVLDB
2010
152views more  PVLDB 2010»
13 years 6 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
AAAI
2006
13 years 9 months ago
Inexact Matching of Ontology Graphs Using Expectation-Maximization
We present a new method for mapping ontology schemas that address similar domains. The problem of ontology mapping is crucial since we are witnessing a decentralized development a...
Prashant Doshi, Christopher Thomas
EDBT
2011
ACM
197views Database» more  EDBT 2011»
12 years 11 months ago
Symmetrizations for clustering directed graphs
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
Venu Satuluri, Srinivasan Parthasarathy
CEC
2005
IEEE
13 years 9 months ago
Graph composition in a graph grammar-based method for automata network evolution
The dynamics of neural and other automata networks are defined to a large extent by their topologies. Artificial evolution constitutes a practical means by which an optimal topolog...
Martin H. Luerssen, David M. W. Powers