Sciweavers

4245 search results - page 459 / 849
» Input Modeling
Sort
View
EUROCRYPT
2007
Springer
15 years 10 months ago
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
Yehuda Lindell, Benny Pinkas
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
15 years 10 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 8 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou
DSVIS
2008
Springer
15 years 8 months ago
Multi-fidelity User Interface Specifications
Specifying user interfaces consists in a fundamental activity in the user interface development life cycle as it informs the subsequent steps. Good quality specifications could lea...
Thomas Memmel, Jean Vanderdonckt, Harald Reiterer
ACL
2010
15 years 4 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler