Sciweavers

16430 search results - page 421 / 3286
» On Computable Tree Functions
Sort
View
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 5 months ago
Secure Multiparty Computation with Partial Fairness
A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a truste...
Amos Beimel, Eran Omri, Ilan Orlov
177
Voted
MST
2010
83views more  MST 2010»
15 years 5 months ago
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
CCS
2007
ACM
15 years 10 months ago
Reconfigurable trusted computing in hardware
Trusted Computing (TC) is an emerging technology towards building trustworthy computing platforms. The Trusted Computing Group (TCG) has proposed several specifications to impleme...
Thomas Eisenbarth, Tim Güneysu, Christof Paar...
FOGA
1990
15 years 8 months ago
A Hierarchical Approach to Learning the Boolean Multiplexer Function
This paper describes the recently developed genetic programming paradigm which genetically breeds populations of computer programs to solve problems. In genetic programming, the i...
John R. Koza
EGH
2009
Springer
15 years 4 months ago
Embedded function composition
A low-level graphics processor is assembled from a collection of hardwired functions of screen coordinates embedded directly in the display. Configuration of these functions is co...
Turner Whitted, James T. Kajiya, Erik Ruf, Ray Bit...