4009 search results - page 326 / 802 » Clustering on Complex Graphs |
187
click to vote
TKDE
2008
15 years 6 months ago
2008
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
193
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
170
click to vote
WISE
2009
Springer
16 years 3 months ago
2009
Springer
Identifying the right-grained services is important to lead the successful service orientation because it has a direct impact on two major goals: the composability of loosely-coupl...
152
click to vote
CLUSTER
2008
IEEE
16 years 1 months ago
2008
IEEE
— Applications raising in many scientific fields exhibit both data and task parallelism that have to be exploited efficiently. A classic approach is to structure those applica...
150
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...