Sciweavers

318 search results - page 49 / 64
» Preimage Relations and Their Matrices
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 9 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
14 years 5 months 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
GCB
2009
Springer
180views Biometrics» more  GCB 2009»
14 years 3 months ago
2D Projections of RNA Folding Landscapes
Abstract: The analysis of RNA folding landscapes yields insights into the kinetic folding behavior not available from classical structure prediction methods. This is especially imp...
Ronny Lorenz, Christoph Flamm, Ivo L. Hofacker
CISS
2008
IEEE
14 years 3 months ago
Multiuser linear precoding for cooperating base stations with asynchronous interference
— This paper addresses multiuser linear precoding using multiple cooperating base stations (BSs). All BSs, and potentially the users, are equipped with multiple antennas. Prior w...
Imad H. Azzam, Raviraj S. Adve
ICASSP
2008
IEEE
14 years 3 months ago
Compressive coded aperture superresolution image reconstruction
Recent work in the emerging field of compressive sensing indicates that, when feasible, judicious selection of the type of distortion induced by measurement systems may dramatica...
Roummel F. Marcia, Rebecca Willett