4218 search results - page 579 / 844 » Complete sets of cooperations |
191
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
In contrast to classical databases and IR systems, real-world information systems have to deal increasingly with very vague and diverse structures for information management and s...
131
click to vote
EDBT
2004
ACM
16 years 4 months ago
2004
ACM
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
119
click to vote
EDBT
2008
ACM
16 years 4 months ago
2008
ACM
We address the problem of generating a mediated schema from a set of relational data source schemas and conjunctive queries that specify where those schemas overlap. Unlike past a...
142
click to vote
ICFP
2005
ACM
16 years 3 months ago
2005
ACM
We present a compositional program logic for call-by-value imperative higher-order functions with general forms of aliasing, which can arise from the use of reference names as fun...
116
Voted
DCC
2008
IEEE
16 years 3 months ago
2008
IEEE
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained ...