Sciweavers

21 search results - page 4 / 5
» Dynamic Magic Sets for Disjunctive Datalog Programs
Sort
View
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 7 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos
CCE
2004
13 years 6 months ago
Continuous reformulations of discrete-continuous optimization problems
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
Oliver Stein, Jan Oldenburg, Wolfgang Marquardt
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
13 years 10 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
SIGMOD
2009
ACM
202views Database» more  SIGMOD 2009»
14 years 6 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
2006
ACM
126views Database» more  SIGMOD 2006»
14 years 6 months ago
Declarative networking: language, execution and optimization
The networking and distributed systems communities have recently explored a variety of new network architectures, both for applicationlevel overlay networks, and as prototypes for...
Boon Thau Loo, Tyson Condie, Minos N. Garofalakis,...