Technical Reports (Computing Science)
Technical Reports Collection
Items in this Collection
- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 13Yang, Herb
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 8Communication Networks
Technical report TR93-02. With the continuing price-performance improvement of small computers there is growing interest in looking again at some of the heuristic techniques developed for problem-solving and planning programs, to see if they can be enhanced or replaced by more algorithmic...
Technical report TR95-13. In this work, we present a uniform behavioral temporal object model which includes a rich and extensible set of types and behaviors to support various notions of time. Our temporal model supports the continuous and discrete domains of time. It also supports various...
Technical report TR06-10. Background: Accurately quantifying the signature information of chemical shifts provides a foundation for accurate and complete sequential resonance assignment in protein NMR spectroscopy. A nearly complete assignment is a prerequisite for three dimensional protein ...
Technical report TR04-19. Despite the proposal of numerous tree-based structures for high-dimensional similarity searches, techniques based on a sequential scan, such as the VA-File, have been shown to be quite effective. In this thesis we present three new access structures which use sequential...
Technical report TR01-09. Victor Allis' proof-number search is a powerful best-first tree search method which can solve games by repeatedly expanding a most-proving node in the game tree. A well-known problem of proof-number search is that it does not account for the effect of transpositions. ...
Technical report TR10-03. Top-k queries are a popular type of query in Wireless Sensor Networks. Typical solutions rely on coordinated root-to-nodes and nodes-to-root messages and on maintaining filters at the nodes, aiming at suppressing unnecessary messages, hence saving energy and furthering...
Technical report TR96-01. Five experiments investigated human belief revision, defining belief revision as a required change to an initial set of beliefs, modeled as a set of propositional sentences, when new information presents a logical inconsistency with the initial set. Certain prescriptive...
The Mutilated Checkerboard Problem in the Lightweight Set Theory of Mizar
Technical report TR96-09. An 8 by 8 checkerboard with two diagonally opposite squares removed cannot be covered by 2 by 1 dominoes. John McCarthy postulates that a mechanized system of heavy duty set theory should accept his formal description of the proposition and his proof that the covering...
Technical report TR03-04. | TRID-ID TR03-04
Technical report TR03-06. Given a set of species and their similarity data, an important problem in evolutionary biology is how to reconstruct a phylogeny (also called evolutionary tree) so that species are close in the phylogeny if and only if they have high similarity. Assume that the...