Sciweavers

1923 search results - page 108 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
ACSAC
2002
IEEE
15 years 2 months ago
Networking in The Solar Trust Model: Determining Optimal Trust Paths in a Decentralized Trust Network
The Solar Trust Model provides a method by which the sender of a message can be authenticated, and the level of trust that can be placed in the sender of the message or the messag...
Michael Clifford
ICDT
2010
ACM
141views Database» more  ICDT 2010»
15 years 1 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
FGCS
2002
89views more  FGCS 2002»
14 years 9 months ago
The Legion support for advanced parameter-space studies on a grid
Parameter-space studies involve running a single application several times with different parameter sets. Since the jobs are mutually independent, many computing resources can be r...
Anand Natrajan, Marty A. Humphrey, Andrew S. Grims...
EUROCRYPT
2005
Springer
15 years 3 months ago
Secure Remote Authentication Using Biometric Data
Biometric data offer a potential source of high-entropy, secret information that can be used in cryptographic protocols provided two issues are addressed: (1) biometric data are n...
Xavier Boyen, Yevgeniy Dodis, Jonathan Katz, Rafai...
BMCBI
2010
146views more  BMCBI 2010»
14 years 10 months ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...