Sciweavers

387 search results - page 45 / 78
» Many Random Walks Are Faster Than One
Sort
View
ICC
2008
IEEE
163views Communications» more  ICC 2008»
14 years 3 months ago
A Virtual Password Scheme to Protect Passwords
—People enjoy the convenience of on-line services, but online environments may bring many risks. In this paper, we discuss how to prevent users’ passwords from being stolen by ...
Ming Lei, Yang Xiao, Susan V. Vrbsky, Chung-Chih L...
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
14 years 2 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
GECCO
2003
Springer
14 years 2 months ago
Selection in the Presence of Noise
For noisy optimization problems, there is generally a trade-off between the effort spent to reduce the noise (in order to allow the optimization algorithm to run properly), and t...
Jürgen Branke, Christian Schmidt 0002
SIMUTOOLS
2008
13 years 10 months ago
Snapshot simulation of internet traffic: fast and accurate for heavy-tailed flows
Simulations involving processes at very different time scales can be so slow to converge that starting in one state and waiting for a representative sample of the state space to b...
R. G. Addie
BIBE
2007
IEEE
110views Bioinformatics» more  BIBE 2007»
14 years 3 months ago
Discrete Methods for Association Search and Status Prediction in Genotype Case-Control Studies
Abstract—Recent improvements in high-throughput genotyping technology make possible genome-wide association studies and status prediction (classification) for common complex dis...
Dumitru Brinza, Alexander Zelikovsky