Sciweavers

1716 search results - page 317 / 344
» Proving Conditional Termination
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 1 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
97
Voted
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 1 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl
191
Voted
VLDB
2005
ACM
109views Database» more  VLDB 2005»
16 years 28 days ago
Model-based approximate querying in sensor networks
Abstract Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that "the sensornet is a database" i...
Amol Deshpande, Carlos Guestrin, Samuel Madden, Jo...
107
Voted
PODS
2005
ACM
130views Database» more  PODS 2005»
16 years 25 days ago
Composition of mappings given by embedded dependencies
Composition of mappings between schemas is essential to support schema evolution, data exchange, data integration, and other data management tasks. In many applications, mappings ...
Alan Nash, Philip A. Bernstein, Sergey Melnik
PODS
2007
ACM
109views Database» more  PODS 2007»
16 years 25 days ago
What is "next" in event processing?
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...