117 search results - page 10 / 24 » Run-Time Bytecode Specialization |
ACMSE
2010
ACM
13 years 7 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
Kernel learning plays an important role in many machine learning tasks. However, algorithms for learning a kernel matrix often scale poorly, with running times that are cubic in t...
VLDB
2006
ACM
14 years 9 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
GMP
2008
IEEE
14 years 4 months ago
2008
IEEE
We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algori...
ISCA
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper presents core fusion, a reconfigurable chip multiprocessor (CMP) architecture where groups of fundamentally independent cores can dynamically morph into a larger CPU, ...