Sciweavers

804 search results - page 48 / 161
» Experiments on Union-Find Algorithms for the Disjoint-Set Da...
Sort
View
ISNN
2011
Springer
12 years 10 months ago
Orthogonal Feature Learning for Time Series Clustering
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
Xiaozhe Wang, Leo Lopes
WWW
2006
ACM
14 years 8 months ago
Compressing and searching XML data via two zips
XML is fast becoming the standard format to store, exchange and publish over the web, and is getting embedded in applications. Two challenges in handling XML are its size (the XML...
Paolo Ferragina, Fabrizio Luccio, Giovanni Manzini...
ICIP
2009
IEEE
14 years 9 months ago
Sparsity And Morphological Diversity For Hyperspectral Data Analysis
Recently morphological diversity and sparsity have emerged as new and effective sources of diversity for Blind Source Separation. Based on these new concepts, novel methods such a...
CITA
2005
IEEE
14 years 1 months ago
Cache Hierarchy Inspired Compression: a Novel Architecture for Data Streams
- We present an architecture for data streams based on structures typically found in web cache hierarchies. The main idea is to build a meta level analyser from a number of levels ...
Geoffrey Holmes, Bernhard Pfahringer, Richard Kirk...
FECS
2006
80views Education» more  FECS 2006»
13 years 9 months ago
A Redesigned Undergraduate Data Communication and Networking Course Incorporating Theory and Practice
Data Communication and Computer Networking is a traditional undergraduate CS course. Classic teaching focuses on communication protocol and algorithm analysis, plus socket programm...
Ziping Liu