3172 search results - page 275 / 635 » On the Random-Self-Reducibility of Complete Sets |
263
Voted
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
234
Voted
SIGMOD
2007
ACM
16 years 6 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...
178
click to vote
EDBT
2004
ACM
16 years 6 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...
160
click to vote
EDBT
2008
ACM
16 years 6 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...
174
click to vote
ICFP
2005
ACM
16 years 6 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...