Sciweavers

581 search results - page 15 / 117
» Fast Hierarchical Clustering Based on Compressed Data
Sort
View
ICIAR
2009
Springer
14 years 4 months ago
Video Compression and Retrieval of Moving Object Location Applied to Surveillance
Abstract. A major problem in surveillance systems is the storage requirements for video archival; videos are recorded continuously for long periods of time, resulting in large amou...
William Robson Schwartz, Hélio Pedrini, Lar...
JGTOOLS
2008
100views more  JGTOOLS 2008»
13 years 10 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
IJCNN
2000
IEEE
14 years 2 months ago
EM Algorithms for Self-Organizing Maps
eresting web-available abstracts and papers on clustering: An Analysis of Recent Work on Clustering Algorithms (1999), Daniel Fasulo : This paper describes four recent papers on cl...
Tom Heskes, Jan-Joost Spanjers, Wim Wiegerinck
BMCBI
2010
121views more  BMCBI 2010»
13 years 7 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
13 years 11 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders