SearchSkip to Search Results
- 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 TR04-07. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative...
Technical report TR98-08. Distributed Shared Memory (DSM) combines the scalability of loosely coupled multicomputer systems with the ease of usability of tightly coupled multiprocessors. DSM has received much attention in the past decade and many consistency models, protocols, and systems were...
Technical report TR05-18. Reconstruction of an evolutionary history for a set of organisms is an important research subject in computational biology. One approach motivated by graph theory constructs a relationship graph based on pairwise evolutionary closeness. The approach builds a tree...
Technical report TR09-05. It is a well known fact that minimizing energy consumption in Wireless Sensor Networks (WSNs) is crucial for its usability; and minimizing the flow of data is one way to achieve that. Most WSN models assume the existence of a base station where query results could in...
A comparison of Junction Tree and Relaxation Algorithms for point matching using different distance metricsDownload
Technical report TR04-04. We have developed a polynomial time optimal method for a class of attributed graph matching problems using the Junction Tree algorithm from Graphical Models. In this paper we compare this method with standard probabilistic relaxation labeling using different forms of...
Technical report TR97-03. One of the key issues for query processing in distributed open environments is the query scheduling problem. Given a user query, after we know that there are n sources that are relevant to the answer of this query, the first issue we need to address is how...
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. ...
Technical report TR94-17. In 1979 Stockman introduced the SSS* minimax search algorithm that dominates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to...
Technical report TR06-26. We investigate the dual approach to dynamic programming and reinforcement learning, based on maintaining an explicit representation of stationary distributions as opposed to value functions. A significant advantage of the dual approach is that it allows one to exploit...
Technical report TR05-06. The availability of complete genomic sequences allows us to infer the evolutionary footprints between species in a global strategy. However, the length of these genomic sequences poses a challenge on computational efficiency and optimality of information representation...