250 search results - page 4 / 50 » A Practical Approach to Morse-Smale Complex Computation: Sca... |
JAIR
2012
11 years 8 months ago
2012
To achieve scalability of query answering, the developers of Semantic Web applications are often forced to use incomplete OWL 2 reasoners, which fail to derive all answers for at ...
AI
2010
Springer
13 years 5 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
PPL
2010
13 years 4 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...
CHI
2001
ACM
14 years 6 months ago
2001
ACM
Despite experience, many users do not make efficient use of complex computer applications. We argue that this is caused by a lack of strategic knowledge that is difficult to acqui...
DCC
2004
IEEE
14 years 5 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...