1449 search results - page 82 / 290 » Self-Randomized Exponentiation Algorithms |
147
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
163
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
170
click to vote
APPINF
2003
15 years 7 months ago
2003
In direct interconnection networks, the collective communication operation one to all, which is usually referred to as broadcasting, can be generalized to allow one source node to...
171
Voted
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
166
click to vote
AAAI
1993
15 years 7 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...