15485 search results - page 293 / 3097 » Computing Optimal Subsets |
214
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
— The problem of placing an arbitrary subset (m) of the (n) closed loop eigenvalues of a nth order continuous time single input linear time invariant(LTI) system, using full stat...
145
click to vote
DCC
2004
IEEE
15 years 10 months ago
2004
IEEE
Modeling of the operational rate-distortion characteristics of a signal can significantly reduce the computational complexity of an optimal bit allocation algorithm. In this repor...
151
click to vote
CIE
2007
Springer
16 years 25 days ago
2007
Springer
This paper introduces two complexity-theoretic formulations of Bennett’s computational depth: finite-state depth and polynomial-time depth. It is shown that for both formulation...
156
Voted
ARITH
2003
IEEE
15 years 12 months ago
2003
IEEE
This paper introduces a method for extracting the core of a Residue Number System (RNS) number within the RNS, this affording a new method for scaling RNS numbers. Suppose an RNS ...
153
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
Problems of secure communication and computation have been studied extensively in network models. Goldreich, Goldwasser, and Linial, Franklin and Yung, and Franklin and Wright have...