Search
Skip to Search Results- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 13Yang, Herb
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 9Databases
- 8Communication Networks
-
2003
Technical report TR03-01. With the growth of available information in digital format, indexing has drawn much attention as a viable solution to reduce retrieval time when searching large databases. There are many indexing techniques available nowadays, but, as they were developed with general...
-
2006
Harms, Janelle, Li, Yuxi, Holte, Robert
Technical report TR06-22. QoS routing has been shown to be NP-hard. A recent study of its hardness shows that the ``worst-case'' may not occur in practice [13]. This suggests that there may exist fast exact algorithms for the multi-constraint shortest path (MCSP) problem, an instance of QoS...
-
2001
Lu, Paul, El-Hajj, Mohammad, Zaiane, Osmar
Technical report TR01-12. Searching for frequent patterns in transactional databases is considered one of the most important data mining problems. Most current association mining algorithms, whether sequential or parallel, adopt an apriori-like algorithm that requires full multiple I/O scans of...
-
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
Technical report TR04-01. Object-oriented frameworks are often misused because programmers do not fully understand them. This dissertation investigates the feasibility and effectiveness of detecting framework constraints from framework-based applications; framework constraints are syntactic rules...
-
2004
Technical report TR04-26. Switch-case statements provide a concise way to express multi-way branching control flow semantics. Switch-cases are common in programs, including script parsers, compilers and virtual machines. Because they occur in widely used programs, optimization for switch-cases...
-
Finding non-Redundant, Statistically Significant Regions in High Dimensional Data: a Novel Approach to Projected and Subspace Clustering
Download2008
Moise, Gabriela, Sander, Joerg
Technical report TR08-03. Projected and subspace clustering algorithms search for clusters of objects in subsets of attributes. Projected clustering computes several disjoint clusters, plus outliers, so that each cluster exists in its own subset of attributes. Subspace clustering enumerates...
-
2005
Rafiei, Davood, Moise, Daniel, Sun, Dabo
Technical report TR05-16. We present a concise and accurate structural summary of XML documents and show that this summary can be used to effectively cluster documents that belong to a structurally similar class. We present efficient formulations of similarity between structural summaries that...
-
2007
Yacef, Kalina, Zaiane, Osmar, Kay, Judy
Technical report TR07-03. Comparing groups or sets is the main focal issue in statistics, and data mining research has also focused on automatically identifying values and instances that differ significantly across groups, known as contrast sets. Whether traditional statistics or the work on...