11345 search results - page 1829 / 2269 » Foundations of Computer Science |
137
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
121
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
139
Voted
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
A standard load balancing model considers placing Ò balls into Ò bins by choosing possible locations for each ball independently and uniformly at random and sequentially placing...
119
click to vote
CSR
2010
Springer
15 years 9 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
147
click to vote
GI
2009
Springer
15 years 9 months ago
2009
Springer
: Modern smartphones provide a high sophisticated camera and a high resolution display. Therefore, they can be used to enable various application scenarios for 1D and 2D barcode re...