784 search results - page 83 / 157 » Relaxing the Value Restriction |
105
click to vote
CPAIOR
2008
Springer
15 years 1 months ago
2008
Springer
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
101
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In secure multi-party computation n parties jointly evaluate an n-variate function f in the presence of an adversary which can corrupt up till t parties. All honest parties are req...
105
click to vote
IPL
2006
14 years 11 months ago
2006
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
119
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
186
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...