Sciweavers

322 search results - page 63 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
BMCBI
2006
137views more  BMCBI 2006»
13 years 7 months ago
A classification-based framework for predicting and analyzing gene regulatory response
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
Anshul Kundaje, Manuel Middendorf, Mihir Shah, Chr...
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 11 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
CVPR
2008
IEEE
14 years 9 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
BMCBI
2005
113views more  BMCBI 2005»
13 years 7 months ago
PentaPlot: A software tool for the illustration of genome mosaicism
Background: Dekapentagonal maps depict the phylogenetic relationships of five genomes in a visually appealing diagram and can be viewed as an alternative to a single evolutionary ...
Lutz Hamel, Olga Zhaxybayeva, J. Peter Gogarten