Search Sciweavers | Sciweavers

77

SIGMOD
1998
ACM

143views Database» more SIGMOD 1998»

Optimal Multi-Step k-Nearest Neighbor Search

15 years 2 months ago

Download www.dbs.informatik.uni-muenchen.de

For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...

Thomas Seidl, Hans-Peter Kriegel

claim paper

Read More »

54

click to vote

STOC
1998
ACM

115views Algorithms» more STOC 1998»

On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas

15 years 2 months ago

Download www.cs.helsinki.fi

Paul Beame, Richard M. Karp, Toniann Pitassi, Mich...

claim paper

Read More »

74

click to vote

ICGI
1998
Springer

105views Natural Language Processing» more ICGI 1998»

Learning k-Variable Pattern Languages Efficiently Stochastically Finite on Average from Positive Data

15 years 2 months ago

Download www-alg.ist.hokudai.ac.jp

Abstract. The present paper presents a new approach of how to convert Gold-style [4] learning in the limit into stochastically finite learning with high confidence. We illustrate t...

Peter Rossmanith, Thomas Zeugmann

claim paper

Read More »

66

click to vote

FOCS
1996
IEEE

111views Theoretical Computer Science» more FOCS 1996»

A 3-Approximation for the Minimum Tree Spanning k Vertices

15 years 1 months ago

Download www.carlyerger.com

In thispaper we give a 3-approximationalgorithmfor the problem ojJnding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximationalgorithmfor t...

Naveen Garg

claim paper

Read More »

56

click to vote

STACS
1997
Springer

84views Theoretical Computer Science» more STACS 1997»

Finding the k Shortest Paths in Parallel

15 years 1 months ago