Sciweavers

804 search results - page 27 / 161
» Experiments on Union-Find Algorithms for the Disjoint-Set Da...
Sort
View
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
13 years 5 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...
ICMCS
2006
IEEE
91views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Detecting Changes in User-Centered Music Query Streams
In this paper, we propose an efficient algorithm, called MQSchange (changes of Music Query Streams), to detect the changes of maximal melody structures in user-centered music quer...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
ACIVS
2006
Springer
14 years 1 months ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...
CVPR
2012
IEEE
11 years 10 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos
CIKM
2004
Springer
14 years 1 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu