Sciweavers

5084 search results - page 1004 / 1017
» Proving Possibility Properties
Sort
View
COMPSEC
2004
131views more  COMPSEC 2004»
13 years 10 months ago
Biometric random number generators
Abstract Up to now biometric methods have been used in cryptography for authentication purposes. In this paper we propose to use biological data for generating sequences of random ...
Janusz Szczepanski, Elek Wajnryb, José M. A...
CSCW
2004
ACM
13 years 10 months ago
Domestic Routines and Design for the Home
The domestic environment is predicted by market analysts to be the major growth area in computing over the next decade, yet it is a poorly understood domain at the current time of...
Andy Crabtree, Tom Rodden
COLING
2002
13 years 10 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
CMPB
2007
86views more  CMPB 2007»
13 years 10 months ago
Monte Carlo simulation of latanoprost induced iris darkening
We show that it is possible to construct numerical models of eye colour from first principles. Our initial model assumes that the important optical interactions occur only in the a...
K. P. B. Cracknell, Damian J. J. Farnell, I. Grier...
DC
2002
13 years 10 months ago
Causality tracking in causal message-logging protocols
Abstract. Casual message-logging protocols have several attractive properties: they introduce no blocking, send no additional messages over those sent by the application, and never...
Lorenzo Alvisi, Karan Bhatia, Keith Marzullo
« Prev « First page 1004 / 1017 Last » Next »