Sciweavers

6251 search results - page 390 / 1251
» Randomness, Computability, and Density
Sort
View
INFOCOM
2008
IEEE
16 years 1 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
TC
2011
15 years 1 months ago
An Architecture for Fault-Tolerant Computation with Stochastic Logic
—Mounting concerns over variability, defects and noise motivate a new approach for digital circuitry: stochastic logic, that is to say, logic that operates on probabilistic signa...
Weikang Qian, Xin Li, Marc D. Riedel, Kia Bazargan...
APPROX
2009
Springer
153views Algorithms» more  APPROX 2009»
16 years 1 months ago
Average-Case Analyses of Vickrey Costs
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ICIP
2001
IEEE
16 years 8 months ago
Geometric hashing techniques for watermarking
In this paper we introduce the idea of using Computer Vision techniques for improving and enhancing watermarking capabilities. Specifically, we incorporate Geometric Hashing techn...
Hagit Zabrodsky Hel-Or, Y. Yitzhaki, Yacov Hel-Or
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
16 years 28 days ago
DCMA: yet another derandomization in covariance-matrix-adaptation
In a preliminary part of this paper, we analyze the necessity of randomness in evolution strategies. We conclude to the necessity of ”continuous”-randomness, but with a much m...
Olivier Teytaud, Sylvain Gelly