6615 search results - page 176 / 1323 » Indexing Multiple Sets |
166
click to vote
FIMI
2003
15 years 8 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...
169
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we address the issue of joint space-time segmentation of image sequences. Typical approaches to such segmentation consider two image frames at a time, and perform t...
182
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Discovering interesting patterns in event sequences is a popular task in the field of data mining. Most existing methods try to do this based on some measure of cohesion to deter...
172
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
178
click to vote
RTSS
2008
IEEE
16 years 27 days ago
2008
IEEE
With the advent of increasingly complex hardware in realtime embedded systems (processors with performance enhancing features such as pipelines, cache hierarchy, multiple cores), ...