213 search results - page 18 / 43 » Counting Independent Sets Using the Bethe Approximation |
AAAI
2000
15 years 1 months ago
2000
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
103
click to vote
ISAAC
2009
Springer
15 years 6 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
101
click to vote
PODS
2012
ACM
13 years 2 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
KDD
2003
ACM
16 years 6 days ago
2003
ACM
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
98
Voted
CIA
2006
Springer
15 years 3 months ago
2006
Springer
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...