Sciweavers

387 search results - page 15 / 78
» Many Random Walks Are Faster Than One
Sort
View
GLOBECOM
2010
IEEE
13 years 7 months ago
Compressive Data Persistence in Large-Scale Wireless Sensor Networks
This paper considers a large-scale wireless sensor network where sensor readings are occasionally collected by a mobile sink, and sensor nodes are responsible for temporarily stori...
Mu Lin, Chong Luo, Feng Liu, Feng Wu
CEC
2008
IEEE
14 years 3 months ago
Generating massive high-quality random numbers using GPU
— Pseudo-random number generators (PRNG) have been intensively used in many stochastic algorithms in artificial intelligence, computer graphics and other scientific computing. ...
Wai-Man Pang, Tien-Tsin Wong, Pheng-Ann Heng
APPROX
2006
Springer
121views Algorithms» more  APPROX 2006»
14 years 23 days ago
A Randomized Solver for Linear Systems with Exponential Convergence
Abstract. The Kaczmarz method for solving linear systems of equations Ax = b is an iterative algorithm that has found many applications ranging from computer tomography to digital ...
Thomas Strohmer, Roman Vershynin
CVPR
2012
IEEE
11 years 11 months ago
Submodular dictionary learning for sparse coding
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
Zhuolin Jiang, Guangxiao Zhang, Larry S. Davis
ATAL
2009
Springer
14 years 3 months ago
Computing optimal randomized resource allocations for massive security games
Predictable allocations of security resources such as police officers, canine units, or checkpoints are vulnerable to exploitation by attackers. Recent work has applied game-theo...
Christopher Kiekintveld, Manish Jain, Jason Tsai, ...