1172 search results - page 79 / 235 » Approximate Reasoning Based on Similarity |
158
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
156
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
153
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
107
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
146
click to vote
ICCBR
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be tr...