Sciweavers

1770 search results - page 257 / 354
» Writing requirements in computer security
Sort
View
ACL
1997
13 years 11 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 9 months ago
A Peer-to-Peer Middleware Framework for Resilient Persistent Programming
The persistent programming systems of the 1980s offered a programming model that integrated computation and long-term storage. In these systems, reliable applications could be eng...
Alan Dearle, Graham N. C. Kirby, Stuart J. Norcros...
SIGSOFT
2010
ACM
13 years 8 months ago
Scalable SMT-based verification of GPU kernel functions
Interest in Graphical Processing Units (GPUs) is skyrocketing due to their potential to yield spectacular performance on many important computing applications. Unfortunately, writ...
Guodong Li, Ganesh Gopalakrishnan
NAR
2010
281views more  NAR 2010»
13 years 5 months ago
PDBselect 1992-2009 and PDBfilter-select
PDBselect (http://bioinfo.tg.fh-giessen.de/pdb select/) is a list of representative protein chains with low mutual sequence identity selected from the protein data bank (PDB) to e...
Sven Griep, Uwe Hobohm
PODC
2012
ACM
12 years 21 days ago
On the (limited) power of non-equivocation
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
Allen Clement, Flavio Junqueira, Aniket Kate, Rodr...