1778 search results - page 229 / 356 » The Theory of Probabilistic Databases |
135
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a natural generalisation of asynchronous bounded delay (ABD) network models. The commonly used ABD models assume a known bound on message delay. This assumption is ofte...
132
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
104
click to vote
DATAMINE
2007
15 years 4 months ago
2007
We propose a novel context sensitive algorithm for evaluation of ordinal attributes which exploits the information hidden in ordering of attributes’ and class’ values and prov...
140
Voted
TWC
2008
15 years 4 months ago
2008
This paper presents a new approach to provide stochastic delay guarantees via fully distributed model-based call admission control for IEEE 802.11 single-hop ad hoc networks. We pr...
139
Voted
AI
2002
Springer
15 years 4 months ago
2002
Springer
This paper provides algorithms that use an information-theoretic analysis to learn Bayesian network structures from data. Based on our three-phase learning framework, we develop e...