2304 search results - page 154 / 461 » On the Vulnerability of Large Graphs |
165
click to vote
CCS
2005
ACM
16 years 1 days ago
2005
ACM
Human-memorable passwords are a mainstay of computer security. To decrease vulnerability of passwords to bruteforce dictionary attacks, many organizations enforce complicated pass...
208
click to vote
ISSTA
2012
ACM
13 years 9 months ago
2012
ACM
Since web applications are easily accessible, and often store a large amount of sensitive user information, they are a common target for attackers. In particular, attacks that foc...
191
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
We present a factor graph based design of a receiver for pilotassisted OFDM-IDMA systems transmitting over frequency-selective channels. The receiver performs joint iterative mult...
140
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time O √ n · log n · log∗ n , that is, sublinear both in the size of th...
155
click to vote
ICASSP
2008
IEEE
16 years 28 days ago
2008
IEEE
We consider a pilot-assisted interleave-division multiple access (IDMA) system transmitting over block-fading channels. We describe this system in terms of a factor graph and use ...