Sciweavers

7716 search results - page 20 / 1544
» Can I pass
Sort
View
IJNSEC
2008
119views more  IJNSEC 2008»
13 years 6 months ago
Pass-Go: A Proposal to Improve the Usability of Graphical Passwords
Inspired by an old Chinese game, Go, we have designed a new graphical password scheme, Pass-Go, in which a user selects intersections on a grid as a way to input a password. While...
Hai Tao, Carlisle Adams
TPDS
1998
108views more  TPDS 1998»
13 years 6 months ago
Critical Path Profiling of Message Passing and Shared-Memory Programs
—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. Our...
Jeffrey K. Hollingsworth
JMLR
2010
137views more  JMLR 2010»
13 years 1 months ago
HOP-MAP: Efficient Message Passing with High Order Potentials
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
Daniel Tarlow, Inmar Givoni, Richard S. Zemel
JMLR
2010
163views more  JMLR 2010»
13 years 1 months ago
Dense Message Passing for Sparse Principal Component Analysis
We describe a novel inference algorithm for sparse Bayesian PCA with a zero-norm prior on the model parameters. Bayesian inference is very challenging in probabilistic models of t...
Kevin Sharp, Magnus Rattray
NIPS
2007
13 years 8 months ago
Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
Amir Globerson, Tommi Jaakkola