Sciweavers

1036 search results - page 41 / 208
» Natural Narrowing for General Term Rewriting Systems
Sort
View
SIGMOD
2007
ACM
157views Database» more  SIGMOD 2007»
14 years 7 months ago
Compiling mappings to bridge applications and databases
Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the...
Sergey Melnik, Atul Adya, Philip A. Bernstein
GPCE
2007
Springer
14 years 1 months ago
Debugging macros
Over the past two decades, Scheme macros have evolved into a powerful API for the compiler front-end. Like Lisp macros, their predecessors, Scheme macros expand source programs in...
Ryan Culpepper, Matthias Felleisen
LICS
1997
IEEE
13 years 12 months ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
MOBISYS
2008
ACM
14 years 7 months ago
Flashproxy: transparently enabling rich web content via remote execution
It is now common for Web sites to use active Web content, such as Flash, Silverlight, or Java applets, to support rich, interactive applications. For many mobile devices, however,...
Alexander Moshchuk, Steven D. Gribble, Henry M. Le...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu