1998 search results - page 157 / 400 » Complexity of the Cover Polynomial |
185
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
189
click to vote
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
In this paper, we present a series of distributed algorithms for coverage verification in sensor networks with no location information. We demonstrate how, in the absence of locali...
167
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— In this paper, the application of combinatorial geometry to noncoherent multiple–symbol differential detection (MSDD) is considered. The resulting algorithm is referred to as...
211
Voted
EUROCRYPT
2004
Springer
16 years 14 days ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
198
Voted
WDAG
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We examine the problem of detecting nested temporal predicates given the execution trace of a distributed program. We present a technique that allows efficient detection ...