2227 search results - page 267 / 446 » Graph Mining based on a Data Partitioning Approach |
162
Voted
TIP
2010
15 years 1 months ago
2010
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
126
Voted
ICPR
2004
IEEE
16 years 4 months ago
2004
IEEE
Numerous clustering algorithms, their taxonomies and evaluation studies are available in the literature. Despite the diversity of different clustering algorithms, solutions delive...
207
click to vote
VLDB
1998
ACM
15 years 7 months ago
1998
ACM
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the featu...
126
Voted
TMC
2008
15 years 3 months ago
2008
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
172
Voted
SODA
2010
ACM
16 years 28 days ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...