15033 search results - page 399 / 3007 » Complexity Theory and Algorithms |
192
click to vote
ECCC
2007
15 years 7 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
168
click to vote
PODC
2010
ACM
15 years 11 months ago
2010
ACM
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
203
click to vote
DCC
2005
IEEE
16 years 7 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...
213
click to vote
DCC
2004
IEEE
16 years 7 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 ...
173
click to vote
CSR
2009
Springer
16 years 2 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 ...