91 search results - page 13 / 19 » Combining Self-reducibility and Partial Information Algorith... |
SIGMOD
1996
ACM
15 years 1 months ago
1996
ACM
We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...
RECOMB
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We introduce an extended computational framework for studying biological systems. Our approach combines formalization of existing qualitative models that are in wide but ...
LATIN
2004
Springer
15 years 2 months ago
2004
Springer
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
117
click to vote
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
We propose a novel conception language for exploring the results retrieved by several internet search services (like search engines) that cluster retrieved documents. The goal is ...