Sciweavers

2520 search results - page 337 / 504
» The complexity of approximating entropy
Sort
View
ALT
2006
Springer
16 years 1 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
ICCAD
2002
IEEE
122views Hardware» more  ICCAD 2002»
16 years 1 months ago
Schedulability analysis of multiprocessor real-time applications with stochastic task execution times
This paper presents an approach to the analysis of task sets implemented on multiprocessor systems, when the task execution times are specified as generalized probability distrib...
Sorin Manolache, Petru Eles, Zebo Peng
CVPR
2010
IEEE
16 years 1 months ago
Locality-constrained Linear Coding for Image Classification
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...
Jinjun Wang, Jianchao Yang, Kai Yu, Fengjun Lv
CTRSA
2009
Springer
155views Cryptology» more  CTRSA 2009»
15 years 11 months ago
Cryptanalysis of CTC2
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
Orr Dunkelman, Nathan Keller
IDA
2009
Springer
15 years 11 months ago
Canonical Dual Approach to Binary Factor Analysis
Abstract. Binary Factor Analysis (BFA) is a typical problem of Independent Component Analysis (ICA) where the signal sources are binary. Parameter learning and model selection in B...
Ke Sun, Shikui Tu, David Yang Gao, Lei Xu