3356 search results - page 135 / 672 » Computing education for sustainability |
170
click to vote
TIT
2010
15 years 1 months ago
2010
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correctio...
147
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Numerical methods for solving the systems of partial differential equations arising in geophysical fluid dynamics rely on a variety of spatial discretization schemes (e.g. finit...
144
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
145
click to vote
CORR
2000
Springer
15 years 6 months ago
2000
Springer
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...
151
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
A report is provided for the ACM SIGKDD community about the 2010 Workshop on Algorithms for Modern Massive Data Sets (MMDS 2010), its origin in MMDS 2006 and MMDS 2008, and future...