Filters








6 Hits in 3.2 sec

Classes of computable functions defined by bounds on computation

E. M. McCreight, A. R. Meyer
1969 Proceedings of the first annual ACM symposium on Theory of computing - STOC '69  
The t-computable classes are shown to be closed under increasing recursively enumerable unions; as a corollary the primitive recursive functions are shown to equal the t-computable functions for a certain  ...  The structure of the functions computable in time or space bounded by t is investigated for recursive functions t.  ...  ACKNOWLEDGMENTS The authors would like to express their sincere appreciation for the interest shown by Manuel Blum, who provided the proof of Theorem  ... 
doi:10.1145/800169.805423 dblp:conf/stoc/McCreightM69 fatcat:wsri2jzfljftpg3ydcnc4e7n4e

Learning recursive functions: A survey

Thomas Zeugmann, Sandra Zilles
2008 Theoretical Computer Science  
A considerable amount of work done in this field has been devoted to the characterization of function classes that can be learned in a given model, the influence of natural, intuitive postulates on the  ...  On the occasion of Rolf Wiehagen's 60th birthday, the last four decades of research in that area are surveyed, with a special focus on Rolf Wiehagen's work, which has made him one of the most influential  ...  Acknowledgements The authors heartily thank the anonymous referees for their careful reading and the many valuable comments made. Sandra Zilles was supported by the Alberta Ingenuity Fund.  ... 
doi:10.1016/j.tcs.2008.02.021 fatcat:5ffx5vkwlbegznwquy7xv6j33m

External memory algorithms and data structures: dealing with massive data

Jeffrey Scott Vitter
2001 ACM Computing Surveys  
We consider a variety of EM paradigms for solving batched and online problems efficiently in external memory.  ...  In this article we survey the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality in order to reduce the I/O costs  ...  Figure 1 is a modified version of a figure by Darren Vengroff, and Figure 2 comes from Cormen et al. [1990] .  ... 
doi:10.1145/384192.384193 fatcat:tunz4fa3rrgv7hwbk7qsvahd5i

Algorithms and Data Structures for External Memory

Jeffrey Scott Vitter
2006 Foundations and Trends® in Theoretical Computer Science  
A variety of EM paradigms are considered for solving batched and online problems efficiently in external memory.  ...  Algorithms and Data Structures for External Memory surveys the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality  ...  Meyer [255] gives an alternate EM algorithm for undirected BFS for sparse graphs, including the dynamic case. Meyer [256] provides new results on approximating the diameter of a graph.  ... 
doi:10.1561/0400000014 fatcat:bkfchugd4fbjvcu5zipnh23k6e

Interoperability, XML Schema [chapter]

2017 Encyclopedia of GIS  
Note that the union of two safe regions is also a safe region.  ...  Hence, the following theorem holds: Theorem 2 Optimally assigning K MBRs among N objects takes O.NK 2 / time.  ...  .a i 1 ; : : : ; a i L / sorted by their increasing order of distance from the centroid a i .  ... 
doi:10.1007/978-3-319-17885-1_100625 fatcat:bgxdhdxa4bewzcggrogz56rdpi

The targum (1916:Dec. 6 - 1916:Dec. 20)

No Name Supplied
1916
As a student organization, the Targum operated under the oversight of the dean of students and student government but in October 1980, the Targum became an independent college paper.  ...  In January 1869, the Targum as we now know it, made its appearance as a monthly paper that concerned itself with student "literary contributions" and college news as well as serving as a vehicle for bringing  ...  The most interesting theorem was "The area of a cycloid is equal to three times the area of the given circle."  ... 
doi:10.7282/t3-1q5b-ag80 fatcat:pupkc6ixjjfvnl6rcls5ral35i