Sciweavers

3208 search results - page 308 / 642
» A Lower Bound for Primality
Sort
View
181
Voted
ICDCN
2010
Springer
15 years 10 months ago
On Communication Complexity of Secure Message Transmission in Directed Networks
Abstract. We re-visit the problem of perfectly secure message transmission (PSMT) in a directed network under the presence of a threshold adaptive Byzantine adversary, having unbou...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
APPROX
2006
Springer
179views Algorithms» more  APPROX 2006»
15 years 10 months ago
Adaptive Sampling and Fast Low-Rank Matrix Approximation
We prove that any real matrix A contains a subset of at most 4k/ + 2k log(k + 1) rows whose span "contains" a matrix of rank at most k with error only (1 + ) times the er...
Amit Deshpande, Santosh Vempala
CSL
2006
Springer
15 years 10 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba
FOCS
1998
IEEE
15 years 10 months ago
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...
CDC
2009
IEEE
144views Control Systems» more  CDC 2009»
15 years 10 months ago
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
Abstract-- Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and...
Charalambos D. Charalambous, Christos K. Kourtella...