549 search results - page 94 / 110 » Computing All the Best Swap Edges Distributively |
79
Voted
BMCBI
2010
14 years 9 months ago
2010
Background: Existing hidden Markov model decoding algorithms do not focus on approximately identifying the sequence feature boundaries. Results: We give a set of algorithms to com...
SIGECOM
2008
ACM
14 years 9 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
ACSAC
2010
IEEE
14 years 7 months ago
2010
IEEE
Instruction-set randomization (ISR) is a technique based on randomizing the "language" understood by a system to protect it from code-injection attacks. Such attacks wer...
PODS
2012
ACM
13 years 2 days ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
IWCMC
2009
ACM
15 years 4 months ago
2009
ACM
This paper proposes a dynamic trust establishment protocol that enables the nodes of an ad hoc network to establish security associations among each other in a distributed and pee...