Sciweavers

1385 search results - page 196 / 277
» Natural Rewriting for General Term Rewriting Systems
Sort
View
SIGMOD
2011
ACM
179views Database» more  SIGMOD 2011»
14 years 9 months ago
How soccer players would do stream joins
In spite of the omnipresence of parallel (multi-core) systems, the predominant strategy to evaluate window-based stream joins is still strictly sequential, mostly just straightfor...
Jens Teubner, René Müller
WWW
2002
ACM
16 years 7 months ago
Clustering for opportunistic communication
We describe ongoing work on I2I, a system aimed at fostering opportunistic communication among users viewing or manipulating content on the Web and in productivity applications. U...
Jay Budzik, Shannon Bradshaw, Xiaobin Fu, Kristian...
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 16 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
KCAP
2003
ACM
15 years 11 months ago
Collecting commonsense experiences
Humans naturally share knowledge by telling stories. This is a form of knowledge exchange we engage in right from early childhood, and over time we learn to recall, order and orga...
Push Singh, Barbara Barry
POPL
2008
ACM
16 years 6 months ago
The design and implementation of typed scheme
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
Sam Tobin-Hochstadt, Matthias Felleisen