Sciweavers

589 search results - page 40 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
AAAI
2006
14 years 11 months ago
Decision Tree Methods for Finding Reusable MDP Homomorphisms
straction is a useful tool for agents interacting with environments. Good state abstractions are compact, reuseable, and easy to learn from sample data. This paper and extends two...
Alicia P. Wolfe, Andrew G. Barto
CIKM
2005
Springer
15 years 3 months ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
EUROMICRO
2007
IEEE
15 years 4 months ago
SensBution: A Rule-Based Peer-to-Peer Approach for Sensor-Based Infrastructures
Ubiquitous environments facilitate the fast and easy access to users’ physical environments. Ubiquitous environments typically capture users’ presence and activities in a room...
Tom Gross, Thilo Paul-Stueve, Tsvetomira Palakarsk...
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
15 years 2 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras
RECOMB
2006
Springer
15 years 10 months ago
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric
The Robinson-Foulds (RF) metric is the measure most widely used in comparing phylogenetic trees; it can be computed in linear time using Day's algorithm. When faced with the n...
Nicholas D. Pattengale, Bernard M. E. Moret