659 search results - page 72 / 132 » Binding as sets of scopes |
176
Voted
VLDB
2001
ACM
16 years 24 days ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
102
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
100
Voted
PERVASIVE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. One of the key challenges faced when developing contextaware pervasive systems is to capture the set of inputs that we want a system to adapt to. Arbitrarily specifying r...
103
Voted
LPNMR
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
68
Voted
CIKM
1997
Springer
15 years 4 months ago
1997
Springer
In this paper, we present a complete analysis of redundant relationships in the entity-relationship model. Existing approaches use the concept of functional dependencies for ident...