Search
Skip to Search Results- 414Computing Science, Department of
- 315Computing Science, Department of/Technical Reports (Computing Science)
- 71Computing Science, Department of/Conference Papers (Computing Science)
- 23Computing Science, Department of/Journal Articles (Computing Science)
- 4Computing Science, Department of/Research Data and Materials (Computing Science)
- 1Computing Science, Department of/Presentations (Computing Science)
- 95Hindle, Abram
- 28Szafron, Duane
- 21Schaeffer, Jonathan
- 19Zaiane, Osmar
- 15Ozsu, M. Tamer
- 14Nascimento, Mario
- 29Database Systems
- 18Artificial Intelligence
- 13Computer Games
- 9Computer Graphics
- 9Databases
- 9Software Engineering
-
1995
Technical report TR95-18. Multimedia databases store large data objects with complex spatial and temporal relationships. For users to easily and effectively access and make use of this large information space, there is a need for an interactive user interface to act as an intermediary between...
-
2010
Lin, Guohui, Shi, Xiaoyu, Hu, Yu, Zeng, Dahua, Zaiane, Osmar
Technical report TR10-04. This paper describes a novel and fast placement algorithm for field programmable gate array (FPGA) design space exploration. The proposed algorithm generates the placement based on the topological similarity between two configurations (netlists) in the design space....
-
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version
Download2010
Nakhost, Hootan, Müller, Martin
Technical report TR10-01. Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become increasingly important. The most recent planning competition IPC-2008 used the cost of the...
-
Adaptive Schema Design and Evaluation in Object-Oriented Information Systems
1995
Technical report TR95-20. This paper develops a formal framework for characterizing \"normalization\" in object-oriented schema design. We introduce style rules for achieving validity, minimality, and extensibility of an object-oriented schema, and the style rules that help to eliminate update...
-
2013
Sturtevant, Nathan R., Valenzano, Richard, Schaeffer, Jonathan
While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause...
-
2009
Malhotra, Baljeet, Nikolaidis, Ioanis, Nascimento, Mario
Technical report TR09-14. We consider the problem of aggregation convergecast scheduling in wireless sensor networks. Aggregation convergecast differs from regular convergecast in that it accommodates transmission dependencies that allow in-network aggregation to be performed. We formulate the...
-
An Adaptive and Efficient Clustering-based Approach for Content Based Image Retrieval in Image Databases
An Adaptive and Efficient Clustering-based Approach for Content Based Image Retrieval in Image Databases
Download2001
Stehling, Renato, Falcao, Alexandre, Nascimento, Mario
Technical report TR01-03. In this paper, we present a new Content-Based Image Retrieval (CBIR) approach which is based on cluster analysis. A distinguishing aspect of CBIR is that it relies on a visual content representation (metadata) of the images. In order to produce such metadata, we propose...
-
An Adaptive Approach to Query Mediation across Hetergeneous Information Sources
1996
Lee, Yooshin, Pu, Calton, Liu, Ling
Technical report TR96-10. We propose a query mediation framework to support customizable information gathering across heterogeneous and autonomous information sources. Instead of an integrated (and static) global schema, we propose an adaptive approach to interoperability which allows information...
-
2006
Nascimento, Mario, Coman, Alexandru, Sander, Joerg
Technical report TR06-24. Wireless sensor networks have received much attention recently. Given their autonomy, flexibility and large range of functionality, they can be used as an effective and discrete means for monitoring data in many domains. Typically the network autonomy implies a limited...