361 search results - page 19 / 73 » Algorithms for Extracting Timeliness Graphs |
DAGSTUHL
2006
13 years 10 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
ACMSE
2005
ACM
14 years 2 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
WABI
2009
Springer
14 years 3 months ago
2009
Springer
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
SIROCCO
2008
13 years 10 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Ontology summarization is very important to quick understanding and selection of ontologies. In this paper, we study extractive summarization of ontology. We propose a notion of R...