Sciweavers

132 search results - page 26 / 27
» Sparse Boolean Matrix Factorizations
Sort
View
DAC
2010
ACM
13 years 7 months ago
Parallel multigrid preconditioning on graphics processing units (GPUs) for robust power grid analysis
Leveraging the power of nowadays graphics processing units for robust power grid simulation remains a challenging task. Existing preconditioned iterative methods that require inco...
Zhuo Feng, Zhiyu Zeng
JPDC
2008
138views more  JPDC 2008»
13 years 7 months ago
Efficient parallel implementation of iterative reconstruction algorithms for electron tomography
Electron tomography (ET) combines electron microscopy and the principles of tomographic imaging in order to reconstruct the threedimensional structure of complex biological specim...
José-Jesús Fernández, Dan Gor...
IM
2007
13 years 8 months ago
Estimating End-to-End Performance by Collaborative Prediction with Active Sampling
— Accurately estimating end-to-end performance in distributed systems is essential both for monitoring compliance with service-level agreements (SLAs) and for performance optimiz...
Irina Rish, Gerald Tesauro
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
14 years 19 days ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
RECSYS
2009
ACM
14 years 1 months ago
Learning to recommend with trust and distrust relationships
With the exponential growth of Web contents, Recommender System has become indispensable for discovering new information that might interest Web users. Despite their success in th...
Hao Ma, Michael R. Lyu, Irwin King