Sciweavers

8109 search results - page 1364 / 1622
» A Model of Component-Based Programming
Sort
View
SIGSOFT
2003
ACM
16 years 5 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
KDD
2008
ACM
134views Data Mining» more  KDD 2008»
16 years 4 months ago
Privacy-preserving cox regression for survival analysis
Privacy-preserving data mining (PPDM) is an emergent research area that addresses the incorporation of privacy preserving concerns to data mining techniques. In this paper we prop...
Shipeng Yu, Glenn Fung, Rómer Rosales, Srir...
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
16 years 4 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
16 years 4 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
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 4 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
« Prev « First page 1364 / 1622 Last » Next »