2168 search results - page 262 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
143
click to vote
CPM
2004
Springer
15 years 8 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
132
click to vote
ACL
2010
15 years 2 months ago
2010
We propose a translation recommendation framework to integrate Statistical Machine Translation (SMT) output with Translation Memory (TM) systems. The framework recommends SMT outp...
135
click to vote
DSVIS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. With the explosion of devices, computing platforms, contextual conditions, user interfaces become more confronted to a need to be adapted to multiple configurations of t...
140
click to vote
NDSS
2006
IEEE
15 years 10 months ago
2006
IEEE
In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather tha...
159
click to vote
ESORICS
2010
Springer
15 years 5 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...