1712 search results - page 271 / 343 » A Computational Approach to Binding Theory |
178
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
157
click to vote
APPROX
2009
Springer
16 years 27 days 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...
163
click to vote
ATAL
2009
Springer
16 years 26 days ago
2009
Springer
Whenever rational agents form coalitions to execute tasks, doing so via a decentralized negotiation process—while more robust and democratic—may lead to a loss of efficiency ...
164
click to vote
MMSEC
2004
ACM
15 years 11 months ago
2004
ACM
In this paper, we introduce a new approach to passive-warden steganography in which the sender embeds the secret message into a certain subset of the cover object without having t...
156
click to vote
GECCO
2010
Springer
15 years 11 months ago
2010
Springer
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...