774 search results - page 86 / 155 » A subdivision-based algorithm for the sparse resultant |
148
click to vote
ICPP
2000
IEEE
15 years 5 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
110
click to vote
JAL
2006
15 years 1 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
111
click to vote
JMLR
2002
15 years 1 months ago
2002
Approximate Bayesian Gaussian process (GP) classification techniques are powerful nonparametric learning methods, similar in appearance and performance to support vector machines....
128
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Recent works showed how low-density parity-check (LDPC) erasure correcting codes, under maximum likelihood (ML) decoding, are capable of tightly approaching the performance of an i...
116
click to vote
PROPERTYTESTING
2010
14 years 11 months ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...