8294 search results - page 84 / 1659 » Presenting Data from Experiments in Algorithmics |
145
Voted
SBACPAD
2003
IEEE
15 years 7 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
104
Voted
CSDA
2007
15 years 2 months ago
2007
Multiple pairwise comparisons are one of the most frequent tasks in applied statistics. In this context, letter displays may be used for a compact presentation of results of multi...
217
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- We present COLR-Tree, an abstraction layer designed to support efficient spatio-temporal queries on live data gathered from a large collection of sensors. We use COLR-Tr...
121
Voted
FIMI
2003
15 years 4 months ago
2003
This paper presents the implementation of kDCI, an enhancement of DCI [10], a scalable algorithm for discovering frequent sets in large databases. The main contribution of kDCI re...
160
click to vote
GCCB
2006
15 years 6 months ago
2006
During the last few years more and more functionalities of RNA have been discovered that were previously thought of being carried out by proteins alone. One of the most striking di...