1688 search results - page 86 / 338 » Implementing Optimizations at Decode Time |
ICALP
2000
Springer
14 years 25 days ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
IWANN
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...
ADAEUROPE
2005
Springer
14 years 2 months ago
2005
Springer
Transparent system support for software fault tolerance reduces performance in general and precludes application-specific optimizations in particular. In contrast, explicit support...
ISQED
2009
IEEE
14 years 4 months ago
2009
IEEE
— This paper revisits and extends a general linear programming(LP) formulation to exploit multiple knobs such as multi-Lgate footprint-compatible libraries and post-layout Lgateb...