Sciweavers

1285 search results - page 213 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
14 years 19 days ago
High Performance Data Mining Using the Nearest Neighbor Join
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...
Christian Böhm, Florian Krebs
ICA3PP
2010
Springer
14 years 15 days ago
Accelerating Euler Equations Numerical Solver on Graphics Processing Units
Abstract. Finite volume numerical methods have been widely studied, implemented and parallelized on multiprocessor systems or on clusters. Modern graphics processing units (GPU) pr...
Pierre Kestener, Frédéric Chât...
COMPGEOM
2009
ACM
14 years 11 days ago
k-means requires exponentially many iterations even in the plane
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....
Andrea Vattani
EDBT
2009
ACM
81views Database» more  EDBT 2009»
14 years 10 days ago
Exploiting similarity-aware grouping in decision support systems
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...
Yasin N. Silva, Muhammad U. Arshad, Walid G. Aref
SIGGRAPH
2010
ACM
14 years 5 days ago
Non-local scan consolidation for 3D urban scenes
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...
Qian Zheng, Andrei Sharf, Guowei Wan, Yangyan Li, ...