Sciweavers

866 search results - page 155 / 174
» A Formal Investigation of
Sort
View
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
16 years 10 days ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 10 days ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts
CHI
2005
ACM
16 years 5 days ago
Towards knowledge building in professional groups
In this submission for the CHI05 Development forum, I reflect on my experience leading the Experience Design community of interest of the American Institute of Graphic Arts and su...
John Zapolski
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
16 years 14 hour ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
ICFP
2006
ACM
15 years 11 months ago
Modelling deterministic concurrent I/O
The problem of expressing I/O and side effects in functional languages is a well-established one. This paper addresses this problem from a general semantic viewpoint by giving a u...
Malcolm Dowse, Andrew Butterfield