Sciweavers

1080 search results - page 49 / 216
» The Complexity of Belief Update
Sort
View
ESORICS
2006
Springer
15 years 10 months ago
Secure Key-Updating for Lazy Revocation
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
Michael Backes, Christian Cachin, Alina Oprea
CAD
2000
Springer
15 years 6 months ago
Efficiently computing and updating triangle strips for real-time rendering
Triangle strips are a widely used hardware-supported data-structure to compactly represent and efficiently render polygonal meshes. In this paper we survey the efficient generatio...
Jihad El-Sana, Francine Evans, Aravind Kalaiah, Am...
ITS
2000
Springer
94views Multimedia» more  ITS 2000»
15 years 9 months ago
DT Tutor: A Decision-Theoretic, Dynamic Approach for Optimal Selection of Tutorial Actions
DT Tutor uses a decision-theoretic approach to select tutorial actions for coached problem solving that are optimal given the tutor's beliefs and objectives. It employs a mode...
R. Charles Murray, Kurt VanLehn
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 6 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ISAAC
2005
Springer
138views Algorithms» more  ISAAC 2005»
15 years 11 months ago
On the Complexity of Rocchio's Similarity-Based Relevance Feedback Algorithm
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
Zhixiang Chen, Bin Fu