2661 search results - page 429 / 533 » Quantum Complexity Classes |
109
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider minimal-rate sampling schemes for streams of delayed and weighted versions of a known pulse shape. Such signals belong to the class of finite rate of innovation (FRI) m...
139
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
107
click to vote
ECCC
2010
15 years 3 months ago
2010
An (r, , )-locally decodable code encodes a k-bit message x to an N-bit codeword C(x), such that for every i [k], the i-th message bit can be recovered with probability 1 - , by ...
112
click to vote
DEDS
2008
15 years 3 months ago
2008
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
135
Voted
ALGORITHMICA
2006
15 years 3 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...