Sciweavers

2485 search results - page 276 / 497
» Time Bounded Frequency Computations
Sort
View
COLOGNETWENTE
2010
13 years 6 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
JOC
2011
81views more  JOC 2011»
13 years 3 months ago
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...
Andreas Enge, Pierrick Gaudry, Emmanuel Thom&eacut...
CALCO
2011
Springer
223views Mathematics» more  CALCO 2011»
12 years 8 months ago
On the Statistical Thermodynamics of Reversible Communicating Processes
Abstract. We propose a probabilistic interpretation of a class of reversible communicating processes. The rate of forward and backward computing steps, instead of being given expli...
Giorgio Bacci, Vincent Danos, Ohad Kammar
FOCS
2008
IEEE
14 years 2 months ago
Learning Geometric Concepts via Gaussian Surface Area
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
Adam R. Klivans, Ryan O'Donnell, Rocco A. Servedio
ATAL
2010
Springer
13 years 9 months ago
A decentralised coordination algorithm for minimising conflict and maximising coverage in sensor networks
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings