17760 search results - page 231 / 3552 » A Generalization of the Massey-Ding Algorithm |
147
click to vote
ACMSE
2009
ACM
15 years 11 months ago
2009
ACM
In a world of increasing Internet connectivity coupled with increasing computer security risks, security conscious network applications implementing blacklisting technology are be...
154
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
166
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
120
Voted
MMSEC
2004
ACM
15 years 10 months ago
2004
ACM
When a host image is watermarked multiple times by the same algorithm collisions can occur. This makes it difficult for an image to host multiple watermarks. But this hosting is n...
112
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...