3591 search results - page 504 / 719 » Typing linear constraints |
231
click to vote
SDB
1995
15 years 10 months ago
1995
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
194
click to vote
CATA
2003
15 years 8 months ago
2003
This paper presents a basic framework for applying static task scheduling techniques to arbitrarily-structured task systems whose targeted execution environment is comprised of fi...
184
click to vote
COMPUTER
2002
15 years 6 months ago
2002
rs use models or abstractions that hide low-level implementation details. Various kinds of representations such as data models, state-transition models, and dataflow models can hel...
197
click to vote
CCR
2008
15 years 6 months ago
2008
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
192
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
In this work we design algorithms for clustering relational columns into attributes, i.e., for identifying strong relationships between columns based on the common properties and ...