1285 search results - page 213 / 257 » On the Complexity of Ordinal Clustering |
103
click to vote
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
103
click to vote
ICA3PP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Finite volume numerical methods have been widely studied, implemented and parallelized on multiprocessor systems or on clusters. Modern graphics processing units (GPU) pr...
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
70
Voted
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
Decision Support Systems (DSS) are information systems that support decision making processes. In many scenarios these systems are built on top of data managed by DBMSs and make e...
SIGGRAPH
2010
ACM
15 years 2 months ago
2010
ACM
Recent advances in scanning technologies, in particular devices that extract depth through active sensing, allow fast scanning of urban scenes. Such rapid acquisition incurs imper...