Sciweavers

50 search results - page 4 / 10
» Clustering and Embedding Using Commute Times
Sort
View
CASES
2003
ACM
13 years 11 months ago
Clustered calculation of worst-case execution times
Knowing the Worst-Case Execution Time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the po...
Andreas Ermedahl, Friedhelm Stappert, Jakob Engblo...
ICML
2010
IEEE
13 years 7 months ago
Power Iteration Clustering
We present a simple and scalable graph clustering method called power iteration clustering (PIC). PIC finds a very low-dimensional embedding of a dataset using truncated power ite...
Frank Lin, William W. Cohen
ICDM
2007
IEEE
140views Data Mining» more  ICDM 2007»
14 years 18 days ago
Finding Cohesive Clusters for Analyzing Knowledge Communities
Documents and authors can be clustered into “knowledge communities” based on the overlap in the papers they cite. We introduce a new clustering algorithm, Streemer, which fin...
Vasileios Kandylas, S. Phineas Upham, Lyle H. Unga...
ISCA
2003
IEEE
93views Hardware» more  ISCA 2003»
13 years 11 months ago
Improving Dynamic Cluster Assignment for Clustered Trace Cache Processors
This work examines dynamic cluster assignment for a clustered trace cache processor (CTCP). Previously proposed cluster assignment techniques run into unique problems as issue wid...
Ravi Bhargava, Lizy Kurian John
MVA
2010
130views Computer Vision» more  MVA 2010»
13 years 4 months ago
Neighborhood linear embedding for intrinsic structure discovery
In this paper, an unsupervised learning algorithm, neighborhood linear embedding (NLE), is proposed to discover the intrinsic structures such as neighborhood relationships, global ...
Shuzhi Sam Ge, Feng Guan, Yaozhang Pan, Ai Poh Loh