638 search results - page 81 / 128 » Efficient algorithms for evaluating xpath over streams |
KDD
2010
ACM
14 years 19 days ago
2010
ACM
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
IJCV
2008
13 years 8 months ago
2008
This paper describes two algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from colour/contr...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
NIPS
2004
13 years 10 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
JUCS
2002
13 years 8 months ago
2002
: In a database with categorical attributes, each attribute defines a partition whose classes can be regarded as natural clusters of rows. In this paper we focus on finding a parti...