Sciweavers

1414 search results - page 27 / 283
» Randomness and Universal Machines
Sort
View
CCS
2009
ACM
14 years 9 months ago
Universally composable contributory group key exchange
We treat the security of group key exchange (GKE) in the universal composability (UC) framework. Analyzing GKE protocols in the UC framework naturally addresses attacks by maliciou...
M. Choudary Gorantla, Colin Boyd, Juan Manuel Gonz...
CAV
2006
Springer
133views Hardware» more  CAV 2006»
14 years 11 days ago
Antichains: A New Algorithm for Checking Universality of Finite Automata
We propose and evaluate a new algorithm for checking the universality of nondeterministic finite automata. In contrast to the standard algorithm, which uses the subset construction...
Martin De Wulf, Laurent Doyen, Thomas A. Henzinger...
ECCC
2007
62views more  ECCC 2007»
13 years 8 months ago
Space Hierarchy Results for Randomized and Other Semantic Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice where a machine is only required to behave appropriately when g...
Jeff Kinne, Dieter van Melkebeek
TREC
2004
13 years 10 months ago
Columbia University in the Novelty Track at TREC 2004
Our system for the Novelty Track at TREC 2004 looks beyond sentence boundaries as well as within sentences to identify novel, nonduplicative passages. It tries to identify text sp...
Barry Schiffman, Kathleen McKeown
TREC
2007
13 years 9 months ago
University of Twente at the TREC 2007 Enterprise Track: Modeling Relevance Propagation for the Expert Search Task
This paper describes several approaches which we used for the expert search task of the TREC 2007 Enterprise track. We studied several methods of relevance propagation from docume...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra