Sciweavers

50 search results - page 2 / 10
» Clustering and Embedding Using Commute Times
Sort
View
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
13 years 11 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...
ECRTS
2004
IEEE
13 years 8 months ago
Schedulability-Driven Partitioning and Mapping for Multi-Cluster Real-Time Systems
We present an approach to partitioning and mapping for multicluster embedded systems consisting of time-triggered and eventtriggered clusters, interconnected via gateways. We have...
Paul Pop, Petru Eles, Zebo Peng, Viacheslav Izosim...
HUMO
2007
Springer
13 years 11 months ago
Robust Spectral 3D-Bodypart Segmentation Along Time
Abstract. In this paper we present a novel tool for body-part segmentation and tracking in the context of multiple camera systems. Our goal is to produce robust motion cues over ti...
Fabio Cuzzolin, Diana Mateus, Edmond Boyer, Radu H...
GD
1999
Springer
13 years 9 months ago
Planarity-Preserving Clustering and Embedding for Large Planar Graphs
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
IDEAL
2007
Springer
13 years 11 months ago
Partitioning-Clustering Techniques Applied to the Electricity Price Time Series
Clustering is used to generate groupings of data from a large dataset, with the intention of representing the behavior of a system as accurately as possible. In this sense, cluster...
Francisco Martínez-Álvarez, Alicia T...