Sciweavers

1285 search results - page 107 / 257
» On the Complexity of Ordinal Clustering
Sort
View
ICMCS
2005
IEEE
126views Multimedia» more  ICMCS 2005»
14 years 3 months ago
A HMM-Embedded Unsupervised Learning to Musical Event Detection
In this paper, an HMM-embedded unsupervised learning approach is proposed to detect the music events by grouping the similar segments of the music signal. This approach can cluste...
Sheng Gao, Yongwei Zhu
BVAI
2005
Springer
14 years 3 months ago
Algorithm That Mimics Human Perceptual Grouping of Dot Patterns
We propose an algorithm that groups points similarly to how human observers do. It is simple, totally unsupervised and able to find clusters of complex and not necessarily convex s...
Giuseppe Papari, Nicolai Petkov
CCGRID
2003
IEEE
14 years 3 months ago
MAGNET: A Tool for Debugging, Analyzing and Adapting Computing Systems
As computing systems grow in complexity, the cluster and grid communities require more sophisticated tools to diagnose, debug and analyze such systems. We have developed a toolkit...
Mark K. Gardner, Wu-chun Feng, Michael Broxton, Ad...
CLUSTER
2003
IEEE
14 years 3 months ago
Distributed Recursive Sets: Programmability and Effectiveness for Data Intensive Applications
This paper presents a concurrent object model based on distributed recursive sets for data intensive applications that use complex, recursive data layouts. The set abstraction is ...
Roxana Diaconescu, Reidar Conradi
IPPS
2003
IEEE
14 years 3 months ago
Quantifying Locality Effect in Data Access Delay: Memory logP
The application of hardware-parameterized models to distributed systems can result in omission of key bottlenecks such as the full cost of inter-node communication in a shared mem...
Kirk W. Cameron, Xian-He Sun