Sciweavers

575 search results - page 16 / 115
» Wichita State University
Sort
View
CADE
1994
Springer
13 years 12 months ago
A Completion-Based Method for Mixed Universal and Rigid E-Unification
We present a completion-based method for handling a new version of E-unification, called "mixed" E-unification, that is a combination of the classical "universal&quo...
Bernhard Beckert
CRYPTO
1991
Springer
105views Cryptology» more  CRYPTO 1991»
13 years 11 months ago
Universal Hashing and Authentication Codes
In this paper, we study the application of universal hashingto the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the nu...
Douglas R. Stinson
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 9 months ago
Intrinsically Universal Cellular Automata
Abstract. We introduce a natural class of cellular automata characterised by a property of the local transition law without any assumption on the states set. We investigate some al...
Nicolas Ollinger
APSEC
2007
IEEE
14 years 2 months ago
E-AoSAS++ and its Software Development Environment
E-AoSAS++ is an aspect-oriented software architecture style for embedded software. It basically gives the style in which a set of state transition machines organizes a software. W...
Masami Noro, Atsushi Sawada, Yoshinari Hachisu, Ma...
CHI
2009
ACM
14 years 8 months ago
Predicting query reformulation during web searching
This paper reports results from a study in which we automatically classified the query reformulation patterns for 964,780 Web searching sessions (composed of 1,523,072 queries) in...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink