7930 search results - page 1440 / 1586 » Greedy in Approximation Algorithms |
159
click to vote
UAI
2001
15 years 5 months ago
2001
In this paper we present a method of computing the posterior probability of conditional independence of two or more continuous variables from data, examined at several resolutions...
112
click to vote
UAI
2004
15 years 5 months ago
2004
For many real-life Bayesian networks, common knowledge dictates that the output established for the main variable of interest increases with higher values for the observable varia...
159
click to vote
WOB
2004
15 years 5 months ago
2004
ABSTRACT. Reconfigurable systolic arrays can be adapted to efficiently resolve a wide spectrum of computational problems; parallelism is naturally explored in systolic arrays and r...
113
click to vote
NIPS
2003
15 years 5 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...
136
click to vote
SDM
2003
SIAM
15 years 5 months ago
2003
SIAM
We study the interaction between global and local techniques in data mining. Specifically, we study the collections of frequent sets in clusters produced by a probabilistic clust...