Sciweavers

372 search results - page 60 / 75
» A Study of The Fragile Base Class Problem
Sort
View
ICDT
1990
ACM
110views Database» more  ICDT 1990»
13 years 12 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
EUROCRYPT
2006
Springer
13 years 11 months ago
Symplectic Lattice Reduction and NTRU
NTRU is a very efficient public-key cryptosystem based on polynomial arithmetic. Its security is related to the hardness of lattice problems in a very special class of lattices. Th...
Nicolas Gama, Nick Howgrave-Graham, Phong Q. Nguye...
EPEW
2008
Springer
13 years 9 months ago
Evaluation of P2P Algorithms for Probabilistic Trust Inference in a Web of Trust
The problem of finding trust paths and estimating the trust one can place in a partner arises in various application areas, including virtual organisations, authentication systems ...
Huqiu Zhang, Aad P. A. van Moorsel
BIB
2006
141views more  BIB 2006»
13 years 7 months ago
Statistical significance in biological sequence analysis
One of the major goals of computational sequence analysis is to find sequence similarities, which could serve as evidence of structural and functional conservation, as well as of ...
Alexander Yu. Mitrophanov, Mark Borodovsky
PR
2006
116views more  PR 2006»
13 years 7 months ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
Stefano Rovetta, Francesco Masulli