Sciweavers

3133 search results - page 511 / 627
» Representing clusters for retrieval
Sort
View
COR
2006
140views more  COR 2006»
15 years 6 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
CSDA
2006
84views more  CSDA 2006»
15 years 6 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans
IJON
2006
169views more  IJON 2006»
15 years 6 months ago
Denoising using local projective subspace methods
In this paper we present denoising algorithms for enhancing noisy signals based on Local ICA (LICA), Delayed AMUSE (dAMUSE) and Kernel PCA (KPCA). The algorithm LICA relies on app...
Peter Gruber, Kurt Stadlthanner, Matthias Böh...
ISM
2006
IEEE
129views Multimedia» more  ISM 2006»
15 years 6 months ago
A Graph-Based Approach for Modeling and Indexing Video Data
In this work, we propose new graph-based data model and indexing to organize and manage video data. To consider spatial and temporal characteristics of video, we introduce a new g...
JeongKyu Lee
FGCS
2007
99views more  FGCS 2007»
15 years 6 months ago
Mining performance data for metascheduling decision support in the Grid
: Metaschedulers in the Grid needs dynamic information to support their scheduling decisions. Job response time on computing resources, for instance, is such a performance metric. ...
Hui Li, David L. Groep, Lex Wolters