13603 search results - page 2563 / 2721 » On the Complexity of Computing Treelength |
184
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
146
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
191
click to vote
DRM
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we consider the functionality that a rights expression language (REL) should provide within a digital rights management (DRM) environment. We begin by noting the dea...
172
click to vote
EMSOFT
2006
Springer
15 years 10 months ago
2006
Springer
Upper bounds on worst-case execution times, which are commonly called WCET, are a prerequisite for validating the temporal correctness of tasks in a real-time system. Due to the e...
179
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...