Sciweavers

2593 search results - page 350 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
ICPR
2008
IEEE
14 years 4 months ago
Optimal feature weighting for the continuous HMM
We propose new Continuous Hidden Markov Model (CHMM) structure that integrates feature weighting component. We assume that each feature vector could include different subsets of f...
Oualid Missaoui, Hichem Frigui
PAKDD
2010
ACM
189views Data Mining» more  PAKDD 2010»
14 years 3 months ago
Subsequence Matching of Stream Synopses under the Time Warping Distance
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen
IPPS
1997
IEEE
14 years 2 months ago
The Sparse Cyclic Distribution against its Dense Counterparts
Several methods have been proposed in the literature for the distribution of data on distributed memory machines, either oriented to dense or sparse structures. Many of the real a...
Gerardo Bandera, Manuel Ujaldon, María A. T...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
14 years 4 months ago
Efficient Clustering for Orders
Lists of ordered objects are widely used as representational forms. Such ordered objects include Web search results or best-seller lists. Clustering is a useful data analysis tech...
Toshihiro Kamishima, Shotaro Akaho
ICS
2009
Tsinghua U.
14 years 2 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...