Sciweavers

6142 search results - page 729 / 1229
» The Complexity of Partition Functions
Sort
View
IJIT
2004
15 years 8 months ago
Computing Entropy for Ortholog Detection
Abstract-- Biological sequences from different species are called orthologs if they evolved from a sequence of a common ancestor species and they have the same biological function....
Hsing-Kuo Pao, John Case
BMCBI
2008
108views more  BMCBI 2008»
15 years 7 months ago
A nonparametric model for quality control of database search results in shotgun proteomics
Background: Analysis of complex samples with tandem mass spectrometry (MS/MS) has become routine in proteomic research. However, validation of database search results creates a bo...
Jiyang Zhang, Jianqi Li, Xin Liu, Hongwei Xie, Yun...
JOCN
2010
126views more  JOCN 2010»
15 years 5 months ago
Evidence for Early Morphological Decomposition in Visual Word Recognition
■ We employ a single-trial correlational MEG analysis technique to investigate early processing in the visual recognition of morphologically complex words. Three classes of affi...
Olla Solomyak, Alec Marantz
ICIP
2009
IEEE
15 years 4 months ago
Randomness-in-Structured Ensembles for compressed sensing of images
Leading compressed sensing (CS) methods require m = O (k log(n)) compressive samples to perfectly reconstruct a k-sparse signal x of size n using random projection matrices (e.g., ...
Abdolreza A. Moghadam, Hayder Radha
CORR
2011
Springer
158views Education» more  CORR 2011»
15 years 2 months ago
SqFreeEVAL: An (almost) optimal real-root isolation algorithm
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...
Michael Burr, Felix Krahmer