2969 search results - page 470 / 594 » A space efficient algorithm for group structure computation |
170
click to vote
ACMSE
2006
ACM
16 years 12 days ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
195
click to vote
DAM
1999
15 years 6 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
181
click to vote
ICCV
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper we describe a new e cient algorithm for recognizing 3D objects by combining photometric and geometric invariants. Some photometric properties are derived, that are i...
220
click to vote
AH
2008
Springer
16 years 24 days ago
2008
Springer
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
175
Voted
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Link structures are important patterns one looks out for when modeling and analyzing social networks. In this paper, we propose the task of mining interesting Link Formation rules...