Search
Skip to Search Results- 7Object-oriented
- 4Databases
- 4Distributed computing
- 4Multimedia
- 4Programming environments
- 3Bioinformatics
-
2003
Greiner, Russell, Wishart, David, Eisner, Roman, Lu, Z., Lu, Paul, Macdonell, Cam, Poulin, B., Szafron, Duane, Anvik, J.
Technical report TR03-14. Identifying the destination or localization of proteins is key to understanding their function and facilitating their purification. A number of existing computational prediction methods are based on sequence analysis. However, these methods are limited in scope, accuracy...
-
1995
MacDonald, Steve, Schaeffer, Jonathan, Novillo, Diego, Woloschuk, David, Parsons, Ian, Szafron, Duane, Iglinski, Paul, Morrow, Chris
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
-
2012
Lanctot, Marc, Gibson, Richard, Burch, Neil, Szafron, Duane
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...
-
1996
Szafron, Duane, Li, John, Ozsu, M. Tamer
Technical report TR96-05. In this paper we consider various spatial relationships that are of general interest for retrieving data from multimedia databases. We present a unified representation of spatial objects for both topological and directional relations. Such a representation is based on...
-
2001
Schaeffer, Jonathan, Charter, K., Lu, Paul, Szafron, Duane, Parsons, I., Driga, A.
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...
-
2004
Cutumisu, M., McNaughton, M., Parker, D., Schaeffer, Jonathan, Redford, J., Szafron, Duane
Technical report TR04-05. Recently, some researchers have argued that generative design patterns (GDPs) can leverage the obvious design re-use that characterizes traditional design patterns into code re-use. This paper provides additional evidence that GDPs are both useful and productive. ...
-
1997
Ozsu, M. Tamer, Li, John, Szafron, Duane
Technical report TR97-01. Declarative query languages are an important feature of database management systems and have played an important role in their success. As database management technology enters the multimedia information system domain, the availability of query languages for multimedia...
-
1995
Szafron, Duane, Ozsu, M. Tamer, Li, John
Technical report TR95-25. Declarative query languages are an important feature of database management systems and have played an important role in their success. As database management technology enters the multimedia information system area, the availability of special-purpose query languages...
-
1994
Szafron, Duane, Schaeffer, Jonathan
Technical report TR94-03. The growth of commercial and academic interest in parallel and distributed computing during the past fifteen years has been accompanied by a corresponding increase in the number of available parallel programming systems (PPS). However, little work has been done to...
-
1998
Leontiev, Yuri, Ozsu, M. Tamer, Szafron, Duane
Technical report TR98-01. In this paper we present a type system that combines inclusion and parametric polymorphism with behaviors (multi-methods) and precise function typing. Type declarations allow user-definable variance specification of type parameters and user-definable subtyping between...