2503 search results - page 166 / 501 » New Algorithms for Statistical Analysis of Interval Data |
147
Voted
DATAMINE
2002
15 years 4 months ago
2002
Discrete values have important roles in data mining and knowledge discovery. They are about intervals of numbers which are more concise to represent and specify, easier to use and ...
170
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
140
click to vote
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
147
click to vote
LCN
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Covert channels aim to hide the existence of communication between two or more parties. Such channels typically utilise pre-existing (overt) data transmissions to carry ...
143
Voted
COMPUTING
2008
15 years 4 months ago
2008
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...