Sciweavers

1191 search results - page 21 / 239
» Completeness and Performance Of The APO Algorithm
Sort
View
SDM
2012
SIAM
294views Data Mining» more  SDM 2012»
11 years 10 months ago
Kernelized Probabilistic Matrix Factorization: Exploiting Graphs and Side Information
We propose a new matrix completion algorithm— Kernelized Probabilistic Matrix Factorization (KPMF), which effectively incorporates external side information into the matrix fac...
Tinghui Zhou, Hanhuai Shan, Arindam Banerjee, Guil...
HIPC
2009
Springer
13 years 5 months ago
Highly scalable algorithm for distributed real-time text indexing
Stream computing research is moving from terascale to petascale levels. It aims to rapidly analyze data as it streams in from many sources and make decisions with high speed and a...
Ankur Narang, Vikas Agarwal, Monu Kedia, Vijay K. ...
CLA
2006
13 years 9 months ago
An Algorithm to Find Frequent Concepts of a Formal Context with Taxonomy
Formal Concept Analysis (FCA) considers attributes as a non-ordered set. This is appropriate when the data set is not structured. When an attribute taxonomy exists, existing techni...
Peggy Cellier, Sébastien Ferré, Oliv...
LCN
2002
IEEE
14 years 21 days ago
Multicast Performance Analysis for High-Speed Torus Networks
Overall efficiency of high-performance computing clusters not only relies on the computing power of the individual nodes, but also on the performance that the underlying network c...
Sarp Oral, Alan D. George
IPPS
2009
IEEE
14 years 2 months ago
Guiding performance tuning for grid schedules
Grid jobs often consist of a large number of tasks. If the performance of a statically scheduled grid job is unsatisfactory, one must decide which code of which task should be imp...
Jörg Keller, Wolfram Schiffmann