Sciweavers

412 search results - page 26 / 83
» Algorithmic Complexity Bounds on Future Prediction Errors
Sort
View
ICCV
2005
IEEE
15 years 5 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu
MST
2010
105views more  MST 2010»
14 years 10 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
GLOBECOM
2006
IEEE
15 years 5 months ago
Exploiting Spatio-Temporal Correlations in MIMO Wireless Channel Prediction
— We investigate prediction algorithms that exploit both temporal and spatial correlations in MIMO correlated narrowband fading wireless channels. We first derive the optimal tw...
Ian C. Wong, Brian L. Evans
BMCBI
2007
160views more  BMCBI 2007»
14 years 12 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
BMCBI
2008
175views more  BMCBI 2008»
14 years 12 months ago
Comprehensive inventory of protein complexes in the Protein Data Bank from consistent classification of interfaces
Background: Protein-protein interactions are ubiquitous and essential for all cellular processes. High-resolution X-ray crystallographic structures of protein complexes can reveal...
Andrew J. Bordner, Andrey A. Gorin