517 search results - page 18 / 104 » Near-Deterministic Inference of AS Relationships |
OTM
2005
Springer
15 years 3 months ago
2005
Springer
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...
UAI
1994
14 years 11 months ago
1994
In this paper we propose a new approach to probabilistic inference on belief networks, global conditioning, which is a simple generalization of Pearl's (1986b) method of loop...
PODS
1999
ACM
15 years 2 months ago
1999
ACM
We give a polymorphic account of the relational algebra. We introduce a formalism of \type formulas" speci cally tuned for relational algebra expressions, and present an algo...
UAI
1998
14 years 11 months ago
1998
People using consumer software applications typically do not use technical jargon when querying an online database of help topics. Rather, they attempt to communicate their goals ...
FSS
2008
14 years 10 months ago
2008
The problem of building recommender systems has attracted considerable attention in recent years. The objective of this paper is to automatically suggest and rank a list of new it...