Sciweavers

2629 search results - page 79 / 526
» complex 2009
Sort
View
ASIACRYPT
2009
Springer
15 years 4 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
FQAS
2009
Springer
202views Database» more  FQAS 2009»
15 years 4 months ago
Controlled Aggregate Tree Shaped Questions over Ontologies
Abstract. Controlled languages (CLs) are ambiguity-free subsets of natural languages such as English offering a good trade-off between the formal rigor of ontology and query langua...
Camilo Thorne, Diego Calvanese
ISSAC
2009
Springer
121views Mathematics» more  ISSAC 2009»
15 years 4 months ago
Faster real feasibility via circuit discriminants
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ...
Frédéric Bihan, J. Maurice Rojas, Ca...
ISW
2009
Springer
15 years 4 months ago
On Free-Start Collisions and Collisions for TIB3
In this paper, we present free-start collisions for the TIB3 hash function with a complexity of about 232 compression function evaluations. By using message modification technique...
Florian Mendel, Martin Schläffer
AIME
2009
Springer
15 years 1 months ago
The Role of Biomedical Dataset in Classification
In this paper, we investigate the role of a biomedical dataset on the classification accuracy of an algorithm. We quantify the complexity of a biomedical dataset using five complex...
Ajay Kumar Tanwani, Muddassar Farooq