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
-
On the epistemic entrenchment of different types of knowledge expressed as conditionals in belief revision tasks
Download1996
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...
-
2005
Xu, Dong, Wu, Xiaomeng, Wan, Xiu-Feng, Lin, Guohui, Gang, Wu
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...
-
On the Trade-Off Between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks
Download2009
Harms, Janelle, Vogt, Ryan, Nascimento, Mario
Technical report TR09-07. By eavesdropping on a user's query in a sensor network, an adversary can deduce both the user's location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. Relying on the principle of k-anonymity, we propose an effective...
-
Quantifying the Uncertainty of a Belief Net Response: Bayesian Error-Bars for Belief Net Inference
Download2007
Van Allen, Tim, Greiner, Russell, Singh, Ajit, Hooper, Peter
Technical report TR07-11. A Bayesian belief network models a joint distribution over variables using a DAG to represent variable dependencies and network parameters to represent the conditional probability of each variable given an assignment to its immediate parents. Existing algorithms assume...
-
2003
Rudnicki, Piotr, Hoover, Jim, Hou, Daqing
Technical report TR03-22. Different program analyses require different information from the source code. For some applications, an AST (Abstract Syntax Tree) representation of the source may be sufficient. We want to be able to specify assertions on the structure of a program without mentioning...
-
PalmIRA: Information Retrieval in the Palm of Your Hand
2002
Technical report TR02-16. Personal Digital Assistants (PDAs) are becoming increasingly popular and with this increase in popularity comes the increased number of applications that store textual data within the PDA. The research area of information retrieval has developed a number of effective and...
-
1994
Schaeffer, Jonathan, Pijls, Wim, Plaat, Aske, de Bruin, Arie
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...
-
2008
Malhotra, Baljeet, Lin, Guohui
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...