486 search results - page 14 / 98 » Improved upper bounds for 3-SAT |
123
click to vote
IACR
2011
14 years 1 months ago
2011
Keccak is one of the five hash functions selected for the final round of the SHA-3 competition and its inner primitive is a permutation called Keccakf. In this paper, we find t...
207
click to vote
ICDT
2009
ACM
16 years 2 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
GLVLSI
1996
IEEE
15 years 6 months ago
1996
IEEE
Important layout properties of electronic designs include space requirements and interconnection lengths. A reliable interconnection length estimation is essential for improving p...
112
click to vote
ALGORITHMICA
2010
15 years 2 months ago
2010
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
104
click to vote
DM
2008
15 years 2 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...