3265 search results - page 77 / 653 » Representing Groups on Graphs |
116
Voted
ICDM
2006
IEEE
15 years 9 months ago
2006
IEEE
The entity resolution (ER) problem, which identifies duplicate entities that refer to the same real world entity, is essential in many applications. In this paper, in particular,...
148
Voted
ICCV
2005
IEEE
15 years 9 months ago
2005
IEEE
This paper presents an efficient algorithm for image segmentation and a framework for perceptual grouping. It makes an attempt to provide one way of combining bottomup and top-do...
160
Voted
ECOOP
1998
Springer
15 years 7 months ago
1998
Springer
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects system. The algorithm is based on a reference list...
125
Voted
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
128
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...