Sciweavers

427 search results - page 6 / 86
» Sequential predictions based on algorithmic complexity
Sort
View
ENTCS
2007
108views more  ENTCS 2007»
14 years 11 months ago
Simulating and Compiling Code for the Sequential Quantum Random Access Machine
We present the SQRAM architecture for quantum computing, which is based on Knill’s QRAM model. We detail a suitable instruction set, which implements a universal set of quantum ...
Rajagopal Nagarajan, Nikolaos Papanikolaou, David ...
ICIC
2005
Springer
15 years 5 months ago
A Nonlinear Adaptive Predictive Control Algorithm Based on OFS Model
Firstly, a method is introduced which uses Volterra series deploying technique to construct a nonlinear model based on OFS model. Then an improved novel incremental mode multiple s...
Haitao Zhang, Zonghai Chen, Ming Li, Wei Xiang, Ti...
BMCBI
2008
131views more  BMCBI 2008»
14 years 11 months ago
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
Min Li, Jianer Chen, Jianxin Wang, Bin Hu, Gang Ch...
CVPR
2008
IEEE
16 years 1 months ago
Sequential particle swarm optimization for visual tracking
Visual tracking usually involves an optimization process for estimating the motion of an object from measured images in a video sequence. In this paper, a new evolutionary approac...
Xiaoqin Zhang, Weiming Hu, Stephen J. Maybank, Xi ...
95
Voted
NIPS
2008
15 years 1 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari