Sciweavers

486 search results - page 14 / 98
» Improved upper bounds for 3-SAT
Sort
View
IACR
2011
149views more  IACR 2011»
12 years 8 months ago
Improved zero-sum distinguisher for full round Keccak-f permutation
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...
Ming Duan, Xuejia Lai
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 9 months ago
Tight results for clustering and summarizing data streams
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...
Sudipto Guha
GLVLSI
1996
IEEE
126views VLSI» more  GLVLSI 1996»
14 years 18 days ago
An Accurate Interconnection Length Estimation for Computer Logic
Important layout properties of electronic designs include space requirements and interconnection lengths. A reliable interconnection length estimation is essential for improving p...
Dirk Stroobandt, Herwig Van Marck, Jan Van Campenh...
ALGORITHMICA
2010
88views more  ALGORITHMICA 2010»
13 years 8 months ago
Improved Bounds for Wireless Localization
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 ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
DM
2008
55views more  DM 2008»
13 years 8 months ago
Improved pebbling bounds
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...
Melody Chan, Anant P. Godbole