Sciweavers

169 search results - page 32 / 34
» Matrix Computations Using Quasirandom Sequences
Sort
View
JAL
2002
113views more  JAL 2002»
13 years 5 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
BMCBI
2005
94views more  BMCBI 2005»
13 years 5 months ago
Measuring similarities between transcription factor binding sites
Background: Collections of transcription factor binding profiles (Transfac, Jaspar) are essential to identify regulatory elements in DNA sequences. Subsets of highly similar profi...
Szymon M. Kielbasa, Didier Gonze, Hanspeter Herzel
ISAAC
2007
Springer
158views Algorithms» more  ISAAC 2007»
13 years 12 months ago
On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
Uffe Flarup, Pascal Koiran, Laurent Lyaudet
BMCBI
2006
116views more  BMCBI 2006»
13 years 5 months ago
Optimized mixed Markov models for motif identification
Background: Identifying functional elements, such as transcriptional factor binding sites, is a fundamental step in reconstructing gene regulatory networks and remains a challengi...
Weichun Huang, David M. Umbach, Uwe Ohler, Leping ...
ECCV
2010
Springer
13 years 4 months ago
Sequential Non-Rigid Structure-from-Motion with the 3D-Implicit Low-Rank Shape Model
So far the Non-Rigid Structure-from-Motion problem has been tackled using a batch approach. All the frames are processed at once after the video acquisition takes place. In this pa...
Marco Paladini, Adrien Bartoli, Lourdes de Agapito