21324 search results - page 519 / 4265 » Making the case for computing |
203
click to vote
SIAMCOMP
2008
15 years 7 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
202
click to vote
RC
2007
15 years 6 months ago
2007
In statistical analysis of measurement results, it is often necessary to compute the range [V , V ] of the population variance V = 1 n · n i=1 (xi −E)2 (where E = 1 n · n i=1 ...
205
click to vote
SOFSEM
2000
Springer
15 years 10 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
176
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
224
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the proble...