Sciweavers

1649 search results - page 215 / 330
» Improved Matrix Interpretation
Sort
View
104
Voted
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 1 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
KDD
2002
ACM
154views Data Mining» more  KDD 2002»
16 years 1 months ago
Mining Protein Contact Maps
The 3D conformation of a protein may be compactly represented in a symmetrical, square, boolean matrix of pairwise, inter-residue contacts, or "contact map". The contact...
Jingjing Hu, Xiaolan Shen, Yu Shao, Chris Bystroff...
RECOMB
2003
Springer
16 years 1 months ago
Modeling dependencies in protein-DNA binding sites
The availability of whole genome sequences and high-throughput genomic assays opens the door for in silico analysis of transcription regulation. This includes methods for discover...
Yoseph Barash, Gal Elidan, Nir Friedman, Tommy Kap...
DCC
2008
IEEE
16 years 12 days ago
Skew Hadamard designs and their codes
Skew Hadamard designs (4n-1, 2n-1, n-1) are associated to order 4n skew Hadamard matrices in the natural way. We study the codes spanned by their incidence matrices A and by I +A a...
Jon-Lark Kim, Patrick Solé
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
15 years 9 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...