Sciweavers

689 search results - page 32 / 138
» A Modal-Logic Based Graph Abstraction
Sort
View
ESANN
2007
13 years 11 months ago
Learning topology of a labeled data set with the supervised generative gaussian graph
Abstract. Discovering the topology of a set of labeled data in a Euclidian space can help to design better decision systems. In this work, we propose a supervised generative model ...
Pierre Gaillard, Michaël Aupetit, Géra...
EPIA
2009
Springer
14 years 4 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...
ICONIP
2008
13 years 11 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...
IICS
2010
Springer
14 years 1 months ago
Actors-media-qualities: a Generic Model for Information Retrieval in Virtual Communities
Abstract: The article presents a model of the structural properties of virtual communities and the information they can access. It argues that a large part of the information – a...
Gregor Heinrich
COCOON
2005
Springer
14 years 3 months ago
New Streaming Algorithms for Counting Triangles in Graphs
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
Hossein Jowhari, Mohammad Ghodsi