Sciweavers

847 search results - page 39 / 170
» Approximation algorithms for projective clustering
Sort
View
GISCIENCE
2004
Springer
112views GIS» more  GISCIENCE 2004»
15 years 9 months ago
Project Lachesis: Parsing and Modeling Location Histories
Abstract. A datatype with increasing importance in GIS is what we call the location history–a record of an entity’s location in geographical space over an interval of time. Thi...
Ramaswamy Hariharan, Kentaro Toyama
IMR
2004
Springer
15 years 9 months ago
Surface Mesh Projection for Hexahedral Mesh Generation by Sweeping
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection o...
Xevi Roca, Josep Sarrate, Antonio Huerta
ASPDAC
1999
ACM
132views Hardware» more  ASPDAC 1999»
15 years 8 months ago
Faster and Better Spectral Algorithms for Multi-Way Partitioning
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
Jan-Yang Chang, Yu-Chen Liu, Ting-Chi Wang
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
16 years 4 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
145
Voted
KDD
2006
ACM
145views Data Mining» more  KDD 2006»
16 years 4 months ago
Deriving quantitative models for correlation clusters
Correlation clustering aims at grouping the data set into correlation clusters such that the objects in the same cluster exhibit a certain density and are all associated to a comm...
Arthur Zimek, Christian Böhm, Elke Achtert, H...