1999 search results - page 337 / 400 » Finding Reductions Automatically |
173
click to vote
POPL
2003
ACM
16 years 3 days ago
2003
ACM
We present an interprocedural and compositional algorithm for finding pairs of compatible allocation sites, which have the property that no object allocated at one site is live at...
STOC
2006
ACM
16 years 3 days ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
171
click to vote
VLDB
2008
ACM
16 years 1 days ago
2008
ACM
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
180
click to vote
SIGMOD
2009
ACM
16 years 1 days ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
MOBISYS
2007
ACM
15 years 11 months ago
2007
ACM
We report on the design, implementation, and evaluation of a system called Cedar that enables mobile database access with good performance over low-bandwidth networks. This is acc...