114 search results - page 9 / 23 » Computing First And Follow Functions For Feature-Theoretic G... |
140
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function fG(x1, . . . , xn) = x1 · x...
146
Voted
TCC
2009
Springer
16 years 4 months ago
2009
Springer
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
150
Voted
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
When selecting alternatives from large amounts of data, trade-offs play a vital role in everyday decision making. In databases this is primarily reflected by the top-k retrieval p...
144
Voted
BMCBI
2005
15 years 3 months ago
2005
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
220
Voted
AMTA
2004
Springer
15 years 9 months ago
2004
Springer
The public demonstration of a Russian-English machine translation system in New York in January 1954 – a collaboration of IBM and Georgetown University – caused a great deal of...