Sciweavers

18090 search results - page 275 / 3618
» Computing by Only Observing
Sort
View
ECUMN
2007
Springer
16 years 21 days ago
A Spatial Communication Model for Ubiquitous Computing Services
Abstract— The paper presents a location-aware communication approach in smart home environments. It is constructed on a symbolic location model to represent the containment relat...
Ichiro Satoh
CRYPTO
2005
Springer
135views Cryptology» more  CRYPTO 2005»
16 years 2 days ago
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
We present a constant-round protocol for general secure multiparty computation which makes a black-box use of a pseudorandom generator. In particular, the protocol does not requir...
Ivan Damgård, Yuval Ishai
CRYPTO
1990
Springer
79views Cryptology» more  CRYPTO 1990»
15 years 10 months ago
Fair Computation of General Functions in Presence of Immoral Majority
This paper describes a method for n players, a majority of which may be faulty, to compute correctly, privately, and fairly any computable function f(Xl, ...,x,) where xi is the i...
Shafi Goldwasser, Leonid A. Levin
AML
2008
66views more  AML 2008»
15 years 6 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
TCS
2008
15 years 6 months ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov