Sciweavers

611 search results - page 15 / 123
» The Cardinality Matrix Constraint
Sort
View
92
Voted
LCC
1994
213views Algorithms» more  LCC 1994»
15 years 1 months ago
Linear Constraint Query Languages: Expressive Power and Complexity
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
Stéphane Grumbach, Jianwen Su, Christophe T...
174
Voted
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
15 years 11 months ago
Counting at Large: Efficient Cardinality Estimation in Internet-Scale Data Networks
Counting in general, and estimating the cardinality of (multi-) sets in particular, is highly desirable for a large variety of applications, representing a foundational block for ...
Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum
JCO
2011
63views more  JCO 2011»
14 years 16 days ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
83
Voted
CP
2004
Springer
15 years 1 months ago
A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...
Willem Jan van Hoeve
ER
2009
Springer
92views Database» more  ER 2009»
15 years 4 months ago
On Matrix Representations of Participation Constraints
Abstract. We discuss the existence of matrix representations for generalised and minimum participation constraints which are frequently used in database design and conceptual model...
Sven Hartmann, Uwe Leck, Sebastian Link