10988 search results - page 180 / 2198 » Algorithmic Folding Complexity |
130
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
123
Voted
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
147
click to vote
DCC
2004
IEEE
16 years 3 months ago
2004
IEEE
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
121
click to vote
ALDT
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
107
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...