32545 search results - page 521 / 6509 » Data Structures and Algorithms |
222
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
216
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
202
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
— Similarity joins have attracted significant interest, with applications in Geographical Information Systems, astronomy, marketing analyzes, and anomaly detection. However, all...
190
click to vote
CIDM
2007
IEEE
15 years 11 months ago
2007
IEEE
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
183
click to vote
ILP
2005
Springer
16 years 18 days ago
2005
Springer
Clustering is a fundamental task in Spatial Data Mining where data consists of observations for a site (e.g. areal units) descriptive of one or more (spatial) primary units, possib...