Sciweavers

961 search results - page 77 / 193
» Significance-Driven Graph Clustering
Sort
View
CSCLP
2006
Springer
15 years 8 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
APCSAC
2003
IEEE
15 years 9 months ago
Mapping Applications to a Coarse Grain Reconfigurable System
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Mi...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 2 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
IPPS
2000
IEEE
15 years 7 months ago
Bandwidth-Efficient Collective Communication for Clustered Wide Area Systems
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
Thilo Kielmann, Henri E. Bal, Sergei Gorlatch
TVCG
2008
95views more  TVCG 2008»
15 years 4 months ago
Improving the Readability of Clustered Social Networks using Node Duplication
Exploring communities is an important task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads...
Nathalie Henry, Anastasia Bezerianos, Jean-Daniel ...