Sciweavers

4325 search results - page 143 / 865
» Incremental computation with names
Sort
View
PVLDB
2008
216views more  PVLDB 2008»
15 years 4 months ago
Ad-hoc data processing in the cloud
Ad-hoc data processing has proven to be a critical paradigm for Internet companies processing large volumes of unstructured data. However, the emergence of cloud-based computing, ...
Dionysios Logothetis, Ken Yocum
ENTCS
2007
99views more  ENTCS 2007»
15 years 6 months ago
Nominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
Ranald A. Clouston, Andrew M. Pitts
IPPS
2006
IEEE
16 years 14 days ago
Simulating and optimizing a peer-to-peer computing framework
The aim of P2P computing is to build virtual computing systems dedicated to large-scale computational problems. JXTA1 proposes an underlying infrastructure on which JNGI2 , one of...
Jean-Baptiste Ernst-Desmulier, Julien Bourgeois, M...
ICDCS
2002
IEEE
15 years 11 months ago
D-Stampede: Distributed Programming System for Ubiquitous Computing
We focus on an important problem in the space of ubiquitous computing, namely, programming support for the distributed heterogeneous computing elements that make up this environme...
Sameer Adhikari, Arnab Paul, Umakishore Ramachandr...
APAL
1998
56views more  APAL 1998»
15 years 6 months ago
Turing Degrees of Certain Isomorphic Images of Computable Relations
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
Valentina S. Harizanov