1763 search results - page 184 / 353 » A Formalization of Polytime Functions |
118
click to vote
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
124
click to vote
BIS
2008
15 years 3 months ago
2008
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
121
click to vote
DGO
2007
15 years 3 months ago
2007
Government e-services available to citizens represent one of the most frequent and critical points of contact between public administrations and citizens. In addition to common se...
137
click to vote
DMS
2008
15 years 3 months ago
2008
: Multimedia applications nowadays are becoming the standard, for they utilize the enormous human brain computational power. In the past, the Relational Database Model was generali...
ACL
2004
15 years 3 months ago
2004
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...