Sciweavers

16430 search results - page 926 / 3286
» On Computable Tree Functions
Sort
View
CAAP
1990
15 years 11 months ago
Coherence of Subsumption
One approach to give semantics to languages with subtypes is by translation to target languages without subtyping: subtypings A 6 B are interpreted via conversion functions A B. ...
Pierre-Louis Curien, Giorgio Ghelli
CTRSA
2008
Springer
100views Cryptology» more  CTRSA 2008»
15 years 9 months ago
A Latency-Free Election Scheme
We motivate and describe the problem of finding protocols for multiparty computations that only use a single broadcast round per computation (latency-free computations). We show t...
Kristian Gjøsteen
BIRTHDAY
2004
Springer
15 years 11 months ago
On Models for Quantified Boolean Formulas
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
Hans Kleine Büning, Xishun Zhao
EDOC
2004
IEEE
15 years 11 months ago
Using Subject-Oriented Modeling to Develop Jini Applications
A major contributing factor to the complexity of creating and evolving distributed systems is the tangling of middleware-specific functionality with core business functionality in...
Gagan Tandon, Sudipto Ghosh
ECCV
2002
Springer
16 years 9 months ago
What Can Be Known about the Radiometric Response from Images?
Abstract. Brightness values of pixels in an image are related to image irradiance by a non-linear function, called the radiometric response function. Recovery of this function is i...
Michael D. Grossberg, Shree K. Nayar