1236 search results - page 95 / 248 » On the Hamkins approximation property |
177
click to vote
ISMIR
2005
Springer
15 years 11 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
193
click to vote
SLSFS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
152
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
203
click to vote
BIBE
2003
IEEE
15 years 11 months ago
2003
IEEE
We present a multi-dimensional indexing approach for fast sequence similarity search in DNA and protein databases. In particular, we propose effective transformations of subsequen...
178
click to vote
EUROCOLT
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...