3356 search results - page 310 / 672 » Computing education for sustainability |
160
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
150
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Let S be an ordered set of disjoint unit spheres in R3 . We show that if every subset of at most six spheres from S admits a line transversal respecting the ordering, then the ent...
171
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
166
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
For academics and practitioners concerned with computers, business and mathematics, one central issue is supporting decision makers. In this paper, we propose a generalization of ...