1998 search results - page 183 / 400 » Complexity of the Cover Polynomial |
186
click to vote
IACR
2011
14 years 6 months ago
2011
The wild McEliece cryptosystem uses wild Goppa codes over finite fields to achieve smaller public key sizes compared to the original McEliece cryptosystem at the same level of se...
153
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
d Abstract) Hanna Mazzawi Technion - Israel Institute of Technology In this paper, we consider the problem of reconstructing a hidden graph with m edges using additive queries. Gi...
200
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...
163
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
285
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...