1941 search results - page 166 / 389 » On the Hardness of Approximate Reasoning |
168
click to vote
LICS
2006
IEEE
16 years 16 days ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
121
click to vote
EXPDB
2006
ACM
16 years 15 days ago
2006
ACM
A substantial part of the database research field focusses on optimizing XQuery evaluation. However, optimization techniques are rarely validated by means of cross platform bench...
144
click to vote
COMPSAC
2005
IEEE
16 years 4 days ago
2005
IEEE
Patching technologies are commonly applied to improve the dependability of software after release. This paper proposes an autonomous hot patching (AHP) framework to fully automate...
172
click to vote
ICLP
2005
Springer
16 years 1 days ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
182
click to vote
INDOCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...