Sciweavers

6300 search results - page 1132 / 1260
» We have it easy, but do we have it right
Sort
View
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
16 years 1 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
ICFP
2002
ACM
16 years 1 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
MOBISYS
2004
ACM
16 years 26 days ago
Tracking Moving Devices with the Cricket Location System
We study the problem of tracking a moving device under two indoor location architectures: an active mobile architecture and a passive mobile architecture. In the former, the infra...
Adam Smith, Hari Balakrishnan, Michel Goraczko, Ni...
POPL
2010
ACM
15 years 10 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
WISE
2009
Springer
15 years 10 months ago
Start Trusting Strangers? Bootstrapping and Prediction of Trust
Web-based environments typically span interactions between humans and software services. The management and automatic calculation of trust are among the key challenges of the futur...
Florian Skopik, Daniel Schall, Schahram Dustdar
« Prev « First page 1132 / 1260 Last » Next »