Sciweavers

12597 search results - page 2399 / 2520
» Complexity of Mechanism Design
Sort
View
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
15 years 10 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
OSDI
2002
ACM
15 years 10 months ago
Using Model Checking to Debug Device Firmware
Device firmware is a piece of concurrent software that achieves high performance at the cost of software complexity. They contain subtle race conditions that make them difficult t...
Sanjeev Kumar, Kai Li
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
15 years 10 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
15 years 10 months ago
ZStream: a cost-based query processor for adaptively detecting composite events
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
Yuan Mei, Samuel Madden
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
15 years 10 months ago
Discovering topical structures of databases
The increasing complexity of enterprise databases and the prevalent lack of documentation incur significant cost in both understanding and integrating the databases. Existing solu...
Wensheng Wu, Berthold Reinwald, Yannis Sismanis, R...
« Prev « First page 2399 / 2520 Last » Next »