Sciweavers

3838 search results - page 228 / 768
» The Autonomic Computing Paradigm
Sort
View
PDCN
2004
15 years 7 months ago
K-Means VQ algorithm using a low-cost parallel cluster computing
It is well-known that the time and memory necessary to create a codebook from large training databases have hindered the vector quantization based systems for real applications. T...
Paulo Sergio Lopes de Souza, Alceu de Souza Britto...
ICIP
1999
IEEE
16 years 8 months ago
Hyperparameter Estimation for Emission Computed Tomography Data
Over the last years many statistical models have been proposed to restore tomographical images. However, their use in medical environment has been limited due to several factors. ...
Aggelos K. Katsaggelos, Antonio López, Rafa...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
ASWEC
2007
IEEE
16 years 24 days ago
Dynamic Protocol Aggregation and Adaptation for Service-Oriented Computing
Service Oriented Computing (SOC) is a paradigm for building new software applications from existing loosely-coupled services. During service composition, services available to pla...
Linh Duy Pham, Alan W. Colman, Jean-Guy Schneider
ICDM
2007
IEEE
131views Data Mining» more  ICDM 2007»
16 years 23 days ago
Parallel Mining of Frequent Closed Patterns: Harnessing Modern Computer Architectures
Inspired by emerging multi-core computer architectures, in this paper we present MT CLOSED, a multi-threaded algorithm for frequent closed itemset mining (FCIM). To the best of ou...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...