Sciweavers

2253 search results - page 82 / 451
» Computing with Realizational Morphology
Sort
View
ISIPTA
2003
IEEE
15 years 9 months ago
Convenient Interactive Computing for Coherent Imprecise Prevision Assessments
A generalization of deFinetti’s Fundamental Theorem of Probability facilitates coherent assessment, by iterated natural extension, of imprecise probabilities or expectations, co...
James Dickey
GCC
2003
Springer
15 years 9 months ago
Grid Computing for the Masses: An Overview
Abstract. The common goals of the Grid and peer-to-peer communities have brought them in close proximity. Both the technologies overlay a collaborative resource-sharing infrastruct...
Kaizar Amin, Gregor von Laszewski, Armin R. Mikler
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
15 years 9 months ago
Minimal Complete Primitives for Secure Multi-party Computation
Abstract. The study of minimal cryptographic primitives needed to implement secure computation among two or more players is a fundamental question in cryptography. The issue of com...
Matthias Fitzi, Juan A. Garay, Ueli M. Maurer, Raf...
CEC
2005
IEEE
15 years 6 months ago
DNA implementation of k-shortest paths computation
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
Zuwairie Ibrahim, Yusei Tsuboi, Mohd Saufee Muhamm...
ENTCS
2010
117views more  ENTCS 2010»
15 years 4 months ago
Categorifying Computations into Components via Arrows as Profunctors
The notion of arrow by Hughes is an axiomatization of the algebraic structure possessed by structured computations in general. We claim that an arrow also serves as a basic compon...
Kazuyuki Asada, Ichiro Hasuo