Sciweavers

10289 search results - page 202 / 2058
» Standard bases in K
Sort
View
ACNS
2005
Springer
111views Cryptology» more  ACNS 2005»
16 years 1 days ago
Badger - A Fast and Provably Secure MAC
We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is us...
Martin Boesgaard, Thomas Christensen, Erik Zenner
FCS
2007
15 years 8 months ago
The Complexity of Futile Questioning
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
Anja Remshagen, Klaus Truemper
WSC
2004
15 years 7 months ago
Using XML and BOMs to Rapidly Compose Simulations and Simulation Environments
This paper explores the application of Base Object Models (BOMs), an emerging XML standard, for rapidly composing simulations and simulation environments. We examine how pattern c...
Paul Gustavson, Tram Chase
ENTCS
2006
172views more  ENTCS 2006»
15 years 6 months ago
Locality of Queries and Transformations
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...
Leonid Libkin
VTC
2008
IEEE
106views Communications» more  VTC 2008»
16 years 26 days ago
Simulation-Based Performance Evaluation of Enhanced Broadcast Schemes for IEEE 802.11-Based Vehicular Networks
—Car-to-car communication (C2CC) enables cars to exchange information that can be used to, e.g., improve the drivers’ safety or comfort. Recently, WLANs based on the IEEE 802.1...
Yvonne Mertens, Matthias Wellens, Petri Mäh&o...