Sciweavers

774 search results - page 56 / 155
» Markov incremental constructions
Sort
View
BMCBI
2002
133views more  BMCBI 2002»
13 years 9 months ago
Identification and characterization of subfamily-specific signatures in a large protein superfamily by a hidden Markov model app
Background: Most profile and motif databases strive to classify protein sequences into a broad spectrum of protein families. The next step of such database studies should include ...
Kevin Truong, Mitsuhiko Ikura
ICDE
2000
IEEE
95views Database» more  ICDE 2000»
14 years 10 months ago
Dynamic Histograms: Capturing Evolving Data Sets
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they...
Donko Donjerkovic, Yannis E. Ioannidis, Raghu Rama...
KBSE
2009
IEEE
14 years 3 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
AAAI
2011
12 years 9 months ago
An Online Spectral Learning Algorithm for Partially Observable Nonlinear Dynamical Systems
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
Byron Boots, Geoffrey J. Gordon
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 9 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin