 |
|
 Phase Transitions in Machine Learning
From its inception in the 1930s, the rich and vigorous field of computer science
has been concerned with the resources, both in time and in memory, needed to
carry out a computation. A number of fundamental theorems were discovered
that resorted to a worst-case analysis. The central question was whether a given
algorithm could be... |  |  Automata, Languages and Programming: 38th International Colloquium, ICALP 2011, Zurich, Switzerland
ICALP 2011, the 38th edition of the International Colloquium on Automata,
Languages and Programming, was held in Z¨urich, Switzerland, during July
4–8, 2011. ICALP is a series of annual conferences of the European Association
for Theoretical Computer Science (EATCS) which first took place in 1972. This
year, the ICALP... |  |  |
|
 GIS Basics
Geographical Information Systems (GIS) are computer systems for storing, displaying and analyzing spatial data. The past twenty years have seen a rapid growth in their use in government, commerce and academia, and they can be used for managing a network of utilities, from handling census data through to planning the location of a new... |  |  Elements of ML Programming, ML97 Edition (2nd Edition)
I became interested in ML programming when I taught CS109, the introduc-
tory Computer Science Foundations course at Stanford, starting in 1991. ML
was used by several of the instructors of this course, including Stu Reges and
Mike Cleron, to introduce concepts such as functional programming and type
systems. It was also used for the... |  |  Approximation Algorithms for NP-Hard Problems
Approximation algorithms have developed in response to the impossibility of solving
a great variety of important optimization problems. Too frequently, when attempting to
get a solution for a problem, one is confronted with the fact that the problem is NP-haid.
This, in the words of Garey and Johnson, means "I can't find an... |
|
|
|
Result Page: 47 46 45 44 43 42 41 40 39 38 37 |