1541 search results - page 113 / 309 » Analysis of Random Noise and Random Walk Algorithms |
146
Voted
COLT
2007
Springer
15 years 10 months ago
2007
Springer
This paper analyzes the potential advantages and theoretical challenges of “active learning” algorithms. Active learning involves sequential sampling procedures that use infor...
123
click to vote
ICCAD
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract—Lithographic limitations and manufacturing uncertainties are resulting in fabricated shapes on wafer that are topologically equivalent, but geometrically different from ...
146
click to vote
TCS
2010
15 years 3 months ago
2010
We present a new approach for an average-case analysis of algorithms and data structures that supports a non-uniform distribution of the inputs and is based on the maximum likelih...
130
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
192
click to vote
STOC
2006
ACM
16 years 5 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...