2957 search results - page 427 / 592 » The Complexity of Polynomial-Time Approximation |
155
click to vote
ICCAD
2002
IEEE
16 years 3 months ago
2002
IEEE
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...
146
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
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...
169
click to vote
CTRSA
2009
Springer
16 years 29 days ago
2009
Springer
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...
162
click to vote
IDA
2009
Springer
16 years 22 days ago
2009
Springer
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...
184
click to vote
MDM
2009
Springer
16 years 22 days ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...