Sciweavers

13214 search results - page 2262 / 2643
» Pseudorandomness for network algorithms
Sort
View
CACM
2006
160views more  CACM 2006»
15 years 7 months ago
Service systems, service scientists, SSME, and innovation
: Computer scientists work with formal models of algorithms and computation, and someday service scientists may work with formal models of service systems, which we define as value...
Paul P. Maglio, Savitha Srinivasan, Jeffrey T. Kre...
DPD
2006
114views more  DPD 2006»
15 years 7 months ago
A novel approach to resource scheduling for parallel query processing on computational grids
Advances in network technologies and the emergence of Grid computing have both increased the need and provided the infrastructure for computation and data intensive applications to...
Anastasios Gounaris, Rizos Sakellariou, Norman W. ...
ESWA
2006
165views more  ESWA 2006»
15 years 6 months ago
Optimal ensemble construction via meta-evolutionary ensembles
In this paper we propose a meta-evolutionary approach to improve on the performance of individual classifiers. In the proposed system, individual classifiers evolve, competing to ...
YongSeog Kim, W. Nick Street, Filippo Menczer
IJON
2006
180views more  IJON 2006»
15 years 6 months ago
Nonnegative independent component analysis based on minimizing mutual information technique
A novel neural network technique for nonnegative independent component analysis is proposed in this letter. Compared with other algorithms, this method can work efficiently even w...
Chun-Hou Zheng, De-Shuang Huang, Zhan-Li Sun, Mich...
MLDM
2008
Springer
15 years 6 months ago
Distributed Monitoring of Frequent Items
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Robert Fuller, Mehmed M. Kantardzic
« Prev « First page 2262 / 2643 Last » Next »