227 search results - page 14 / 46 » Identifying and Generating Easy Sets of Constraints for Clus... |
100
click to vote
SMI
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we present a novel modeling method for synthesizing rough surfaces using discrete surface growth models. We employ a two-pass method. Initial point cluster data is ...
ISMIR
2004
Springer
15 years 3 months ago
2004
Springer
The automatic analysis of singing from music is an important and challenging issue within the research target of content-based retrieval of music information. As part of this rese...
PAMI
2006
14 years 9 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
BPM
2009
Springer
15 years 4 months ago
2009
Springer
The goal of process mining is to discover process models from event logs. However, for processes that are not well structured and have a lot of diverse behavior, existing process m...
APWEB
2004
Springer
15 years 3 months ago
2004
Springer
Queries to data warehouses often involve hundreds of complex aggregations over large volumes of data, and so it is infeasible to compute these queries by scanning the data sources ...