134 search results - page 22 / 27 » Speeding Up Dynamic Shortest-Path Algorithms |
ICCAD
2006
IEEE
14 years 1 months ago
2006
IEEE
In addition to wirelength, modern placers need to consider various constraints such as preplaced blocks and density. We propose a high-quality analytical placement algorithm consi...
WAIFI
2010
Springer
14 years 19 days ago
2010
Springer
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...
AAAI
2011
12 years 7 months ago
2011
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private networ...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper we describe the OnEQL system, a query engine that implements optimization techniques and evaluation strategies to speed up the evaluation time of querying a...