17185 search results - page 3259 / 3437 » Computational and Quantitative Studies |
165
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
229
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
197
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
165
click to vote
CRYPTO
2009
Springer
16 years 1 months ago
2009
Springer
The problem of carrying out cryptographic computations when the participating parties are rational in a game-theoretic sense has recently gained much attention. One problem that h...
170
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...