17541 search results - page 3319 / 3509 » Complexity in scalable computing |
134
click to vote
DSN
2004
IEEE
15 years 7 months ago
2004
IEEE
The authors describe the use of bounded model checking (BMC) for verifying Web application code. Vulnerable sections of code are patched automatically with runtime guards, allowin...
138
click to vote
CMSB
2006
Springer
15 years 7 months ago
2006
Springer
Type checking and type inference are important concepts and methods of programming languages and software engineering. Type checking is a way to ensure some level of consistency, d...
151
click to vote
COLT
2006
Springer
15 years 7 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...
112
click to vote
CSR
2006
Springer
15 years 7 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....
163
Voted
DRM
2006
Springer
15 years 7 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...