Sciweavers

30 search results - page 3 / 6
» A Fast General Methodology for Information - Theoretically O...
Sort
View
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
13 years 3 months ago
Laplacian Spectrum Learning
Abstract. The eigenspectrum of a graph Laplacian encodes smoothness information over the graph. A natural approach to learning involves transforming the spectrum of a graph Laplaci...
Pannagadatta K. Shivaswamy, Tony Jebara
CGO
2008
IEEE
13 years 12 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
KDD
2003
ACM
152views Data Mining» more  KDD 2003»
14 years 5 months ago
Interactive exploration of coherent patterns in time-series gene expression data
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we pr...
Daxin Jiang, Jian Pei, Aidong Zhang
SAC
2011
ACM
12 years 8 months ago
New hybrid genetic algorithm for solving optimal communication spanning tree problem
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
BMCBI
2010
132views more  BMCBI 2010»
13 years 5 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...