Sciweavers

231 search results - page 7 / 47
» Two lower bounds for self-assemblies at temperature 1
Sort
View
CODES
2006
IEEE
15 years 3 months ago
Thermal-aware high-level synthesis based on network flow method
Lowering down the chip temperature is becoming one of the important design considerations, since temperature adversely and seriously affects many of design qualities, such as reli...
Pilok Lim, Taewhan Kim
DMIN
2006
115views Data Mining» more  DMIN 2006»
14 years 10 months ago
Indexing Spatio-Temporal Trajectories with Orthogonal Polynomials
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
Elena Braynova
DM
2010
77views more  DM 2010»
14 years 9 months ago
Representing (0, 1)-matrices by boolean circuits
A boolean circuit represents an n by n (0,1)-matrix A if it correctly computes the linear transformation y = Ax over GF(2) on all n unit vectors. If we only allow linear boolean f...
Stasys Jukna
ECCC
2010
95views more  ECCC 2010»
14 years 9 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
64
Voted
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith