which lists information on earned doctoral degrees of theoretical computer scientists, is currently in the process of being published on the World-Wide Web. We describe the document, its...
Clouds and Stars: Efficient Real-Time Procedural Sky Rendering Using 3D Hardware (2008)
Real-time virtual reality applications, including games, increasingly use outdoor environments. A common task in an earth-type environment is to render a sky that is realistic both in terms of...
Game programming classes have been offered at the University of North Texas continuously since 1993. The classes are project based, and feature collaborative coursework with art majors in UNT’s...
A Note on the Complexity of Reliability in Neural Networks (2008)
Piotr Berman, Ian Parberry, Georg Schnitger
It is shown that in a standard discrete neural network model with small fan-in, tolerance to random malicious faults can be achieved with a log-linear increase in the number of neurons and a constant...
On the Computational Complexity of Optimal Sorting Network Verification (2008)
A sorting network is a combinational circuit for sorting, constructed from comparison-swap units. The depth of such a circuit is a measure of its running time. It is reasonable to hypothesize that...
Gene Eu Jan, Ki-yin Chang, Su Gao, Ian Parberry
The maze routing problem is to find an optimal path between a given pair of cells on a grid plane. Lee’s algorithm and its variants, probably the most widely used maze routing method, fails to work...
The Pairwise Sorting Network (2008)
A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting...
From Artistry to Automation: A Structured Methodology for Procedural Content Creation (2008)
Abstract. Procedural techniques will soon automate many aspects of content creation for computer games. We describe an efficient, deterministic, methodology for procedurally generating 3D game...
Are Hopfield Networks Faster Than Conventional Computers? (2008)
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to converge, a stable state...
General Terms Design, Experimentation (2008)
The University of North Texas has for many years offered classes in game programming to Computer Science students and classes in game art and design to art students. A key feature of these classes is...
Tiffany Barnes, Unc Charlotte, Ian Parberry, Joe Geigel
year for this meeting, and the first that has an academic track with refereed papers. This year 71 papers were submitted. Each paper received three reviews. Based on the reviewers ’ feedback, the...
Errata to "Problems on Algorithms" (2007)
Ian Parberry, Plato Phaedrus, Ralph Waldo Emerson
this document and other useful information can be found on the World-Wide Web (Parberry [7]). I welcome further errata and comments from readers --- I prefer electronic mail, but if you must use more...
The Internet and the Aspiring Games Programmer (2007)
The Internet is an important tool for aspiring computer game programmers, providing access to information, advice from peers, and electronic publishing. We examine employment prospects in the...
Sorting and Order Statistics (2007)
ly as possible into two sublists L 1 and L 2 , sort each of L 1 and L 2 recursively, and then merge them together. function mergesort(L; n) comment sort a list L of n objects 1. if n 1 then return(L)...
F61.01> and L 2 , sort each of L 1 and L 2 recursively, and then merge them together. Author's address: Dept. of Computer Sciences, Univ. of North Texas, P.O. Box 13886, Denton, TX...
On the Computational Complexity of Optimal Sorting Network Verification (2007)
A sorting network is a combinational circuit for sorting, constructed from comparison-swap units. The depth of such a circuit is a measure of its running time. It is reasonable to hypothesize that...
A Form for Referees in Theoretical Computer Science (2007)
The Referee's Form is designed to help referees communicate more clearly with Editors. It is not intended to replace the formal written report, but is intended as a clear, concise synopsis. The
A Speaker's Guide for Students (2007)
There are many points in your career at which you will be called upon to present a paper in
A Form for Referees in Theoretical Computer Science (2007)
The Referee's Form is designed to help referees communicate more clearly with Editors. It is not intended to replace the formal written report, but is intended as a clear, concise synopsis. The
How to Present a Paper: A Speaker’s Guide 1 (2000)
Congratulations. You are one of only a few who would bother reading a guide on successful presentation style. Most people don’t believe they need to learn how to make a presentation. Stand up,...
How to Present a Paper: A Speaker's Guide (2000)
the Major Results Describe the key results of the presentation. You will probably have to get a little technical here but do so gradually and carefully. . Explain the Significance of the Results...
Practical Issues in the Complexity of Neural Networks. (1998)
Parberry, Ian, Berman, Piotr, Schnitger, Georg
The equipment purchased under this Grant was used to supplement the theoretical work done under AFOSR-87-0400 with experimental results. The primary use of the equipment was to perform experiments to...
A Complexity Theory of Neural Networks. (1998)
Parberry, Ian, Berman, Piotr, Schnitger, Georg
Significant results have been obtained on the computation complexity of analog neural networks, and distribute voting. The computing power and learning algorithms for limited precision analog neural...
A Complexity Theory of Neural Networks. (1998)
Berman, Piotr, Schnitger, Georg, Parberry, Ian
Significant progress has been made in laying the foundations of a complexity theory of neural networks. The fundamental complexity classes have been identified and studied. The class of problems...
Scalability in Neural Network Learning and Computation. (1998)
Progress has been made in six topics in the area of computational complexity of neural networks. The loading problem for analog neural networks with only 6 nodes is NP-complete. Some foundational...
Sorting and Order Statistics (1998)
We will analyze the number of comparisons needed to solve the problem of sorting n distinct items into ascending order, and the related problem of selecting the kth smallest item from an unsorted...
Sorting and Order Statistics (1998)
per bound of ndlog ne comparisons. Finally, in Section 1.4 we will verify by mathematical induction that the exact number of comparisons used by mergesort is exactly ndlog ne \Gamma 2 dlogne + 1. 1.1...
Scalability of a Neural Network for the Knight's Tour Problem (1997)
The effectiveness and efficiency of a Hopfield-style neural network recently proposed by Takefuji and Lee for the knight's tour problem on an n \Theta n board are compared and contrasted with...
30.03> = j + 1 then return(a) 6. else if k j then return(select(S 1 ; k)) 7. else return(select(S 2 ,k \Gamma j \Gamma 1)) Line 3 is the familiar pivoting operation from quicksort. Let T (n) be...
mallest value. Then, S 1 is empty and S 2 has n \Gamma 1 values, and so TW (n) = ( 0 if n 1 TW (n \Gamma 1) + n \Gamma 1 otherwise. Author's address: Dept. of Computer Sciences, Univ. of North...
Scalability of a neural network for the knight’s tour problem (1996)
The e ectiveness and e ciency of a Hop eld-style neural network recently proposed by Takefuji and Lee for the knight's tour problem on an n n board are compared and contrasted with standard...
Circuit Complexity and Feedforward Neural Networks (1996)
Circuit complexity, a subfield of computational complexity theory, can be used to analyze how the resource usage of neural networks scales with problem size. The computational complexity of discrete...
Errata to "Problems on Algorithms" (1996)
Ian Parberry, Plato Phaedrus, Ralph Waldo Emerson
this document and other useful information can be found on the World-Wide Web (Parberry [7]). I welcome further errata and comments from readers --- I prefer electronic mail, but if you must use more...
The Internet and the Aspiring Games Programmer (1995)
The Internet is an important tool for aspiring computer game programmers, providing access to information, advice from peers, and electronic publishing. We examine employment prospects in the...
A real-time algorithm for the (n 2 − 1)-puzzle (1995)
A real-time algorithm for the (n 2 − 1)-puzzle is designed using greedy and divideand-conquer techniques. It is proved that (ignoring lower order terms) the new algorithm uses at most 5n 3 moves,...
A Form for Referees in Theoretical Computer Science (1994)
truly abstract the essential contribution of the paper? Is the author's grammar, syntax, semantics, and spelling correct? Does the Introduction adequately introduce and motivate the topic? Does...
How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students (1993)
the Major Results Describe the key results of the paper. You may present the statements of the major Theorems, but not their proofs. You will probably have to get a little technical here, but do so...
On the complexity of learning with a small number of nodes (1992)
It is shown that the loading problem for a 6 node neural network with node function set AC 0 1 (that is, the conjunction or disjunction of a subset of the inputs or their complements) is NP complete....
Knowledge, understanding, and computational complexity (1992)
Searle’s arguments that intelligence cannot arise from formal programs are refuted by arguing that his analogies and thought-experiments are fundamentally flawed: he imagines a world in which...
A computer assisted optimal depth lower bound for nine-input sorting networks (1991)
It is demonstrated, using a combination of theoretical and experimental computer science, that there is no nine-input sorting network of depth six. If a nine-input sorting network of depth six...
Load Sharing with Parallel Priority Queues (1991)
For maximum efficiency in a multiprocessor system the load should be shared evenly over all processors, that is, there should be no idle processors when tasks are available. The delay in a load...
Load sharing with parallel priority queues (Extended Abstract (1991)
For maximum efficiency in a multiprocessor system the load should be shared evenly over all processors, that is, there should be no idle processors when tasks are available. The delay in a load...
The Pennsylvania State University, (1990)
The time required by a variant of the PRAM (a parallel machine model which consists of sequential processors which communicate by reading and writing into a common shared memory) to compute a...
A guide for new referees in theoretical computer science. Bulletin of the EATCS (1990)
Your success as a scientist will in part be measured by the quality of your research publications in high-quality journals and conference proceedings. Of the three classical rhetorical techniques, it...
A Guide for New Referees in Theoretical Computer Science (1989)
The title of the paper should clearly and succinctly describe the subject of the research. "Cute" but uninformative titles are considered inappropriate, but the occasional pun is tolerable....
A Guide for New Referees in Theoretical Computer Science (1989)
The title of the paper should clearly and succinctly describe the subject of the research. "Cute" but uninformative titles are considered inappropriate, but the occasional pun is tolerable....
A Guide for New Referees in Theoretical Computer Science (1989)
The title of the paper should clearly and succinctly describe the subject of the research. "Cute" but uninformative titles are considered inappropriate, but the occasional pun is tolerable....
A Guide for New Referees in Theoretical Computer Science (1989)
The title of the paper should clearly and succinctly describe the subject of the research. "Cute" but uninformative titles are considered inappropriate, but the occasional pun is tolerable....
A Guide for New Referees in Theoretical Computer Science (1989)
The title of the paper should clearly and succinctly describe the subject of the research. "Cute" but uninformative titles are considered inappropriate, but the occasional pun is tolerable....
How to present a paper in theoretical computer science: A speaker's guide for students (1988)
There are many points in your career at which you will be called upon to present a paper in
How to present a paper in theoretical computer science: A speaker's guide for students (1988)
There are many points in your career at which you will be called upon to present a paper in
How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students (1988)
the Major Results Describe the key results of the paper. You may present the statements of the major theorems, but not their proofs. You will probably have to get a little technical here, but do so...
How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students (1988)
the Major Results Describe the key results of the paper. You may present the statements of the major theorems, but not their proofs. You will probably have to get a little technical here, but do so...
How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students (1988)
the Major Results Describe the key results of the paper. You may present the statements of the major theorems, but not their proofs. You will probably have to get a little technical here, but do so...
How to Present a Paper in Theoretical Computer Science: A Speaker's Guide for Students (1988)
the Major Results Describe the key results of the paper. You may present the statements of the major theorems, but not their proofs. You will probably have to get a little technical here, but do so...