303 search results - page 42 / 61 » Computing Minimal Spanning Subgraphs in Linear Time |
IISWC
2009
IEEE
14 years 2 months ago
2009
IEEE
—In the era of multi-core, computer vision has emerged as an exciting application area which promises to continue to drive the demand for both more powerful and more energy effi...
COLT
1999
Springer
13 years 12 months ago
1999
Springer
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
SAC
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...
ECRTS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
EUROPAR
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. We describe a general component software framework designed for demanding grid environments that provides optimal performance for the assembled component application. Thi...