2944 search results - page 284 / 589 » Improving Bound Propagation |
158
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is no...
189
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
173
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
178
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
167
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...