Sciweavers

1439 search results - page 237 / 288
» Fast approximation of centrality
Sort
View
DIM
2008
ACM
13 years 11 months ago
Quantifying the security of preference-based authentication
We describe a technique aimed at addressing longstanding problems for password reset: security and cost. In our approach, users are authenticated using their preferences. Experime...
Markus Jakobsson, Liu Yang, Susanne Wetzel
EUROPAR
2008
Springer
13 years 11 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
NIPS
2008
13 years 11 months ago
Mixed Membership Stochastic Blockmodels
Consider data consisting of pairwise measurements, such as presence or absence of links between pairs of objects. These data arise, for instance, in the analysis of protein intera...
Edoardo Airoldi, David M. Blei, Stephen E. Fienber...
SDM
2008
SIAM
150views Data Mining» more  SDM 2008»
13 years 11 months ago
A Stagewise Least Square Loss Function for Classification
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...
Shuang-Hong Yang, Bao-Gang Hu
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 11 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards