2899 search results - page 179 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
171
click to vote
ISCAS
2006
IEEE
16 years 17 days ago
2006
IEEE
— Symmetric-key block ciphers are often used to provide data confidentiality with low complexity, especially in the case of dedicated hardware implementations. IDEA NXT is a nov...
187
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
144
click to vote
ICIP
2004
IEEE
16 years 8 months ago
2004
IEEE
This paper proposes two techniques for low-complexity rate-distortion (R-D) optimized streaming of packetized video. These techniques enable computing packet transmission schedule...
167
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
185
click to vote
AGI
2008
15 years 8 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...