Sciweavers

1132 search results - page 63 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
CORR
2010
Springer
114views Education» more  CORR 2010»
14 years 6 months ago
Secure Communication over Parallel Relay Channel
We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel wh...
Zohaib Hassan Awan, Abdellatif Zaidi, Luc Vandendo...
ECCC
2010
117views more  ECCC 2010»
14 years 10 months ago
Nearly Tight Bounds for Testing Function Isomorphism
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
Sourav Chakraborty, David García-Soriano, A...
ICLP
2007
Springer
15 years 3 months ago
User-Definable Resource Bounds Analysis for Logic Programs
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
Jorge Navas, Edison Mera, Pedro López-Garc&...
TSP
2010
14 years 6 months ago
Rate distortion bounds on passive sonar performance
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
Tianzhu Meng, John R. Buck
SPAA
2010
ACM
15 years 4 months ago
Basic network creation games
We study a natural network creation game, in which each node locally tries to minimize its local diameter or its local average distance to other nodes, by swapping one incident ed...
Noga Alon, Erik D. Demaine, MohammadTaghi Hajiagha...