Sciweavers

3972 search results - page 592 / 795
» Cosparse analysis modeling - uniqueness and algorithms
Sort
View
ESA
2003
Springer
116views Algorithms» more  ESA 2003»
16 years 8 days ago
Smoothed Motion Complexity
We propose a new complexity measure for movement of objects, the smoothed motion complexity. Many applications are based on algorithms dealing with moving objects, but usually data...
Valentina Damerow, Friedhelm Meyer auf der Heide, ...
BMCBI
2011
15 years 2 months ago
RAIphy: Phylogenetic classification of metagenomics samples using iterative refinement of relative abundance index profiles
Background: Computational analysis of metagenomes requires the taxonomical assignment of the genome contigs assembled from DNA reads of environmental samples. Because of the diver...
Ozkan U. Nalbantoglu, Samuel F. Way, Steven H. Hin...
PAMI
2011
15 years 2 months ago
Rigid and Articulated Point Registration with Expectation Conditional Maximization
—This paper addresses the issue of matching rigid and articulated shapes through probabilistic point registration. The problem is recast into a missing data framework where unkno...
Radu Horaud, Florence Forbes, Manuel Yguel, Guilla...
ALMOB
2008
95views more  ALMOB 2008»
15 years 7 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
DAC
1998
ACM
15 years 11 months ago
Adjoint Transient Sensitivity Computation in Piecewise Linear Simulation
This paper presents a general method for computing transient sensitivities using the adjoint method in event driven simulation algorithms that employ piecewise linear device model...
Tuyen V. Nguyen, Anirudh Devgan, Ognen J. Nastov