2252 search results - page 96 / 451 » Lower Bounds for Dynamic Algorithms |
137
click to vote
SIAMCOMP
2011
14 years 8 months ago
2011
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
ISNN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Compared to normal learning algorithms, for example backpropagation, the optimal bounded ellipsoid (OBE) algorithm has some better properties, such as faster convergence,...
121
click to vote
ASIACRYPT
2009
Springer
15 years 8 months ago
2009
Springer
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
121
Voted
PAAPP
2000
15 years 1 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
106
click to vote
EOR
2008
15 years 1 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...