Sciweavers

216 search results - page 22 / 44
» Fast Optimal Algorithms for Computing All the Repeats in a S...
Sort
View
SIGIR
2009
ACM
14 years 3 months ago
Fast nonparametric matrix factorization for large-scale collaborative filtering
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
Kai Yu, Shenghuo Zhu, John D. Lafferty, Yihong Gon...
CVPR
2006
IEEE
14 years 10 months ago
Control Theory and Fast Marching Techniques for Brain Connectivity Mapping
We propose a novel, fast and robust technique for the computation of anatomical connectivity in the brain. Our approach exploits the information provided by Diffusion Tensor Magne...
Emmanuel Prados, Stefano Soatto, Christophe Lengle...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 days ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
IFIP
1999
Springer
14 years 27 days ago
Frontier: A Fast Placement System for FPGAs
In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-...
Russell Tessier
IEEEPACT
2006
IEEE
14 years 2 months ago
Fast, automatic, procedure-level performance tuning
This paper presents an automated performance tuning solution, which partitions a program into a number of tuning sections and finds the best combination of compiler options for e...
Zhelong Pan, Rudolf Eigenmann