6365 search results - page 119 / 1273 » Fast Local Computation Algorithms |
115
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
232
click to vote
Publication
The size of computer networks, along with their bandwidths, is growing exponentially. To support these large, high-speed networks, it is neccessary to be able to forward packets in...
130
click to vote
ASIACRYPT
1999
Springer
15 years 7 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
113
Voted
NIPS
2003
15 years 4 months ago
2003
In applying Hidden Markov Models to the analysis of massive data streams, it is often necessary to use an artificially reduced set of states; this is due in large part to the fac...
102
Voted
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...