3466 search results - page 460 / 694 » Fast computation of special resultants |
148
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
187
click to vote
NSDI
2010
15 years 8 months ago
2010
Byzantine fault-tolerant (BFT) replication has enjoyed a series of performance improvements, but remains costly due to its replicated work. We eliminate this cost for read-mostly ...
203
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
179
click to vote
ISCAPDCS
2004
15 years 8 months ago
2004
Scheduling and load-balancing techniques play an integral role in reducing the overall execution time of scientific applications on clustered multi-node systems. The increasing co...
184
click to vote
WSC
1997
15 years 8 months ago
1997
We present an extension to an existing SPARC V8 instruction set simulator, SimICS, to support accurate profiling of branches and instruction cache misses. SimICS had previously su...