Sciweavers

849 search results - page 141 / 170
» Completely Non-malleable Schemes
Sort
View
JNW
2008
101views more  JNW 2008»
13 years 9 months ago
Computational Time-Division and Code-Division Channel Access Scheduling in Ad Hoc Networks
Using two-hop neighborhood information, we present the hybrid activation multiple access (HAMA) protocol for time-division channel access scheduling in ad hoc networks with omni-di...
Lichun Bao, J. J. Garcia-Luna-Aceves
ECCC
2007
99views more  ECCC 2007»
13 years 9 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
ENTCS
2007
109views more  ENTCS 2007»
13 years 9 months ago
Constructive Membership Predicates as Index Types
In the constructive setting, membership predicates over recursive types are inhabited by terms indexing the elements that satisfy the criteria for membership. In this paper, we mo...
James Caldwell, Josef Pohl
IS
2007
13 years 9 months ago
Schema-conscious XML indexing
User queries on extensible markup language (XML) documents are typically expressed as regular path expressions. A variety of indexing techniques for efficiently retrieving the re...
Krishna P. Leela, Jayant R. Haritsa
TIT
2008
103views more  TIT 2008»
13 years 9 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah