Sciweavers

8669 search results - page 274 / 1734
» Computing matrix representations
Sort
View
132
Voted
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 24 days ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
112
Voted
ICCAD
2002
IEEE
143views Hardware» more  ICCAD 2002»
16 years 15 days ago
A Markov chain sequence generator for power macromodeling
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...
Xun Liu, Marios C. Papaefthymiou
117
Voted
IJCV
2007
115views more  IJCV 2007»
15 years 3 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
125
Voted
PPSN
1994
Springer
15 years 7 months ago
RPL2: A Language and Parallel Framework for Evolutionary Computing
The Reproductive Plan Language 2 (RPL2) is an extensible interpreted language for writing and using evolutionary computing programs. It supports arbitrary genetic representations,...
Patrick D. Surry, Nicholas J. Radcliffe
140
Voted
ICIP
2004
IEEE
16 years 5 months ago
Shear-resize factorizations for fast multi-modal volume registration
Intensity-based methods work well for multi-modal image registration owing to their effectiveness and simplicity, but the computation for geometric transforms is a heavy load. To ...
Ying Chen, Pengwei Hao, Jian Yu