Sciweavers

534 search results - page 66 / 107
» Power from Random Strings
Sort
View
FOCS
1990
IEEE
14 years 1 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum
EUROCRYPT
2007
Springer
14 years 1 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
EACL
1993
ACL Anthology
13 years 11 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace
ICNP
2007
IEEE
14 years 4 months ago
HEXA: Compact Data Structures for Faster Packet Processing
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley...
TCOM
2010
131views more  TCOM 2010»
13 years 8 months ago
Distance-based node activation for geographic transmissions in fading channels
In wireless multi-hop packet radio networks (MPRNs) that employ geographic transmissions, sleep schedules or node activation techniques may be used to power off some nodes to cons...
Tathagata D. Goswami, John M. Shea, Murali Rao, Jo...