Sciweavers

1541 search results - page 84 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
VTC
2007
IEEE
107views Communications» more  VTC 2007»
14 years 3 months ago
Random Switched Beamforming for Uplink Wireless Sensor Networks
– Integration of beamforming to sensors is very beneficial for a reduction of transmission power consumption and for improvement of the overall system performance. Unfortunately,...
Mohammed Elmusrati, Vesa Hasu
STACS
2005
Springer
14 years 2 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt
COMPGEOM
2009
ACM
14 years 3 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
SDM
2010
SIAM
181views Data Mining» more  SDM 2010»
13 years 7 months ago
Efficient Nonnegative Matrix Factorization with Random Projections
The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical...
Fei Wang, Ping Li
SAT
2007
Springer
107views Hardware» more  SAT 2007»
14 years 3 months ago
Combining Adaptive Noise and Look-Ahead in Local Search for SAT
Abstract. The adaptive noise mechanism was introduced in Novelty+ to automatically adapt noise settings during the search [4]. The local search algorithm G2 WSAT deterministically ...
Chu Min Li, Wanxia Wei, Harry Zhang