Sciweavers

2061 search results - page 85 / 413
» The continuous knapsack set
Sort
View
4OR
2010
137views more  4OR 2010»
14 years 10 months ago
Extended formulations in combinatorial optimization
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
Michele Conforti, Gérard Cornuéjols,...
EDBT
2012
ACM
308views Database» more  EDBT 2012»
13 years 7 days ago
Transactional stream processing
Many stream processing applications require access to a multitude of streaming as well as stored data sources. Yet there is no clear semantics for correct continuous query executi...
Irina Botan, Peter M. Fischer, Donald Kossmann, Ne...
PSD
2004
Springer
77views Database» more  PSD 2004»
15 years 3 months ago
Fast Generation of Accurate Synthetic Microdata
Generation of a synthetic microdata set that reproduces the statistical properties of an original microdata set is a promising approach to statistical disclosure control (SDC) of m...
Josep Maria Mateo-Sanz, Antoni Martínez-Bal...
MDAI
2007
Springer
15 years 4 months ago
A Version of Lebesgue Decomposition Theorem for Non-additive Measure
In this paper, Lebesgue decomposition type theorems for non-additive measure are shown under the conditions of null-additivity, converse null-additivity, weak null-additivity and Ï...
Jun Li, Masami Yasuda, Jianzeng Li
SSDBM
2006
IEEE
162views Database» more  SSDBM 2006»
15 years 3 months ago
On-line Aggregation and Filtering of Pattern-based Queries
We consider an environment where a subscription system continuously evaluates pattern-based requests over unbounded sequential data. We propose an extension of the traditional pat...
Cédric du Mouza, Philippe Rigaux, Michel Sc...