1018 search results - page 150 / 204 » On the minimization of XPath queries |
KDD
2005
ACM
16 years 9 days ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
105
click to vote
STOC
2001
ACM
16 years 5 days ago
2001
ACM
We study two fundamental static data structure problems, membership and perfect hashing, in Yao's cell probe model. The first space and bit probe optimal worst case upper bou...
104
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
The knowledge discovery process is interactive in nature and therefore minimizing query response time is imperative. The compute and memory intensive nature of data mining algorit...
85
Voted
CAV
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. A temporal interface for a software component is a finite automaton that specifies the legal sequences of calls to functions that are provided by the component. We comp...
102
click to vote
DOLAP
2004
ACM
15 years 5 months ago
2004
ACM
Parallelism can be used for major performance improvement in large Data warehouses (DW) with performance and scalability challenges. A simple low-cost shared-nothing architecture ...