ERA users may experience an intermittent Deposit/Save error. We apologize for any inconvenience this may cause. Thank you for your patience while we work to resolve the issue. When the work is completed, we'll remove this notice.
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 TR05-08. We study the problem of visualizing large networks and develop techniques for effectively abstracting a network and reducing the size to a level that can be clearly viewed. Our size reduction techniques are based on sampling, where only a sample instead of the full...
Technical report TR07-13. Software system grows in size and complexity as it evolves over time. The fact that object-oriented software is increasingly developed using an evolutionary development process makes the situa-tion even worse. The developers face increasing difficulties in comprehending...
On the epistemic entrenchment of different types of knowledge expressed as conditionals in belief revision tasksDownload
Technical report TR96-16. Some belief revision theories appeal to the notion of epistemic entrenchment as a guide to choosing among alternative ways of removing inconsistency that new information may cause with existing beliefs. While belief revision theorists may not be interested in natural...
Technical report TR10-02. A ubiquitous feature of planning problems -- problems involving the automatic generation of action sequences for attaining a given goal -- is the need to economize limited resources such as fuel or money. While heuristic search, mostly based on standard algorithms such...
Technical report TR08-07. In gene expression microarray data analysis, biclustering has been demonstrated to be one of the most effective methods for discovering gene expression patterns under various conditions. We present in this study a framework to take advantage of the homogeneously...
Technical report TR95-24. The traditional presentation of Kowalski's Event Calculus as a logic program uses Negation- as-Failure (NAF) in an essential way to support persistence of fluents. In this paper we present an implementation of Event Calculus as a purely logical (without NAF) Linear...
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...
Technical report TR95-02. This paper contains an introduction and user manual for the Enterprise Parallel Programming System, including the programming model, the meta-programming model and tools (animation, replay and debugging). | TRID-ID TR95-02
User Constrained Multiscale MRF Model for Texture Mixture Synthesis and its Application to Texture ReplacementDownload
Technical report TR05-25. The original multiscale MRF texture model proposed by Paget (IEEE Transactions on Image Processing, 1998, page 925-931) can be used to synthesize a broad range of textures but is limited to taking a single input texture and outputting a homogeneous texture similar to the...
Technical report TR01-10. For two DNA or protein sequences of length m and n, dynamic programming alignment algorithms like Needleman-Wunsch and Smith-Waterman take O(m x n) time and use O(m x n) space, so we refer to them as full matrix (FM) algorithms. This space requirement means that large...