Sciweavers

160 search results - page 24 / 32
» Definition and Complexity of Some Basic Metareasoning Proble...
Sort
View
INFOCOM
2003
IEEE
14 years 23 days ago
Pseudo Likelihood Estimation in Network Tomography
Abstract— Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today’s fast growing Internet, accompani...
Gang Liang, Bin Yu
NIPS
2000
13 years 8 months ago
Discovering Hidden Variables: A Structure-Based Approach
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. As s...
Gal Elidan, Noam Lotner, Nir Friedman, Daphne Koll...
PODS
2008
ACM
174views Database» more  PODS 2008»
14 years 7 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
ECAI
2006
Springer
13 years 11 months ago
Resolving Conflicts in Action Descriptions
Abstract. We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this form...
Thomas Eiter, Esra Erdem, Michael Fink, Ján...
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
13 years 11 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen