2520 search results - page 98 / 504 » The complexity of approximating entropy |
ISIPTA
2005
IEEE
15 years 3 months ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
ICCSA
2003
Springer
15 years 3 months ago
2003
Springer
A heuristic method to construct uniform approximations to analytic transcendental functions is developed as a generalization of the Hermite-Pad´e interpolation to infinite interv...
COCO
2003
Springer
15 years 3 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
124
click to vote
ATAL
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
113
click to vote
AAAI
2007
15 years 20 days ago
2007
Efficient query answering over ontologies is one of the most useful and important services to support Semantic Web applications. Approximation has been identified as a potential...