17471 search results - page 341 / 3495 » Information Modeling |
163
click to vote
KR
2004
Springer
16 years 3 days ago
2004
Springer
The goal of producing a general purpose, semantically motivated, and computationally tractable deductive reasoning service remains surprisingly elusive. By and large, approaches t...
242
click to vote
ICOIN
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
173
click to vote
IPSN
2003
Springer
15 years 12 months ago
2003
Springer
In this paper we study a dynamic sensor selection method for Bayesian filtering problems. In particular we consider the distributed Bayesian Filtering strategy given in [1] and sh...
164
click to vote
INFOVIS
2002
IEEE
15 years 11 months ago
2002
IEEE
Relational databases provide significant flexibility to organize, store, and manipulate an infinite variety of complex data collections. This flexibility is enabled by the concept...
178
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...