5115 search results - page 103 / 1023 » On Randomized Lanczos Algorithms |
130
Voted
ISCA
2003
IEEE
15 years 8 months ago
2003
IEEE
We introduce a load-balanced adaptive routing algorithm for torus networks, GOAL - Globally Oblivious Adaptive Locally - that provides high throughput on adversarial traffic patt...
120
click to vote
EUROCRYPT
2001
Springer
15 years 7 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...
117
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper we present a new approximation algorithm for the Max Acyclic Subgraph problem. Given an instance where the maximum acyclic subgraph contains 1/2 + δ fraction of all...
151
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....