Sciweavers

966 search results - page 30 / 194
» Small Alliances in Graphs
Sort
View
KDD
2004
ACM
148views Data Mining» more  KDD 2004»
14 years 9 months ago
Fast discovery of connection subgraphs
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
Christos Faloutsos, Kevin S. McCurley, Andrew Tomk...
ILP
2003
Springer
14 years 1 months ago
On Condensation of a Clause
In this paper, we investigate condensation of a clause. First, we extend a substitution graph introduced by Scheffer et al. (1996) to a total matcher graph. Then, we give a correc...
Kouichi Hirata
EPIA
2009
Springer
14 years 3 months ago
An Algorithm to Discover the k-Clique Cover in Networks
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
Luís Cavique, Armando B. Mendes, Jorge M. A...
ISSS
1997
IEEE
109views Hardware» more  ISSS 1997»
14 years 25 days ago
Reducing the Complexity of ILP Formulations for Synthesis
Integer Linear Programming ILP is commonly used in high level and system level synthesis. It is an NP-Complete problem in general cases. There exists some tools that give an o...
Anne Mignotte, Olivier Peyran
ICONIP
2008
13 years 10 months ago
Neurocognitive Approach to Clustering of PubMed Query Results
Abstract. Internet literature queries return a long lists of citations, ordered according to their relevance or date. Query results may also be represented using Visual Language th...
Pawel Matykiewicz, Wlodzislaw Duch, Paul M. Zender...