21324 search results - page 462 / 4265 » Making the case for computing |
171
click to vote
ENTCS
2007
15 years 7 months ago
2007
Many programming calculi have been designed to have a Curry-Howard correspondence with a classical logic. We investigate the effect that different choices of logical connective ha...
137
click to vote
TCS
1998
15 years 6 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
191
click to vote
SCIENTOMETRICS
2010
15 years 5 months ago
2010
Abstract. Given the current availability of different bibliometric indicators and of production and citation data sources, the following two questions immediately arise: do the in...
185
click to vote
SIGOPS
2010
15 years 5 months ago
2010
The rise of ad-hoc data-intensive computing has led to the development of data-parallel programming systems such as Map/Reduce and Hadoop, which achieve scalability by tightly cou...
318
click to vote
PODS
2004
ACM
16 years 7 months ago
2004
ACM
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...