Sciweavers

817 search results - page 32 / 164
» An Optimal Linear Time Algorithm for Quasi-Monotonic Segment...
Sort
View
DRR
2010
13 years 11 months ago
Time and space optimization of document content classifiers
Scaling up document-image classifiers to handle an unlimited variety of document and image types poses serious challenges to conventional trainable classifier technologies. Highly...
Dawei Yin, Henry S. Baird, Chang An
TIP
1998
142views more  TIP 1998»
13 years 8 months ago
Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF
Abstract—We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse...
Mila Nikolova, Jérôme Idier, Ali Moha...
ICSM
2007
IEEE
14 years 3 months ago
Discovering Dynamic Developer Relationships from Software Version Histories by Time Series Segmentation
Time series analysis is a promising approach to discover temporal patterns from time stamped, numeric data. A novel approach to apply time series analysis to discern temporal info...
Harvey P. Siy, Parvathi Chundi, Daniel J. Rosenkra...
COLT
2005
Springer
14 years 2 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
BMCBI
2002
108views more  BMCBI 2002»
13 years 8 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy