ISTCS 1997 | Sciweavers

23

ISTCS
1997
Springer

250views Applied Computing» more ISTCS 1997»

Learning with Queries Corrupted by Classification Noise

13 years 8 months ago

Kearns introduced the "statistical query" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this ...

Jeffrey C. Jackson, Eli Shamir, Clara Shwartzman

claim paper

Read More »

15

click to vote

ISTCS
1997
Springer

220views Applied Computing» more ISTCS 1997»

Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs

13 years 8 months ago

Download www.lifl.fr

Vladimir Grebinski, Gregory Kucherov

claim paper

Read More »

14

click to vote

ISTCS
1997
Springer

234views Applied Computing» more ISTCS 1997»

Exact Analysis of Exact Change

13 years 8 months ago

Download www.eng.tau.ac.il

We introduce the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most ...

Pat Frankel

claim paper

Read More »

18

click to vote

ISTCS
1997
Springer

278views Applied Computing» more ISTCS 1997»

Faster subtree isomorphism

13 years 8 months ago

Download www.cs.bgu.ac.il

We study the subtree isomorphism problem: Given trees H and G, ﬁnd a subtree of G which is isomorphic to H or decide that there is no

Ron Shamir, Dekel Tsur

claim paper

Read More »

30

click to vote

ISTCS
1997
Springer

289views Applied Computing» more ISTCS 1997»

An Exact Quantum Polynomial-Time Algorithm for Simon's Problem

13 years 8 months ago

Download pages.cpsc.ucalgary.ca

We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the...

Gilles Brassard, Peter Høyer

claim paper

Read More »

15

click to vote

ISTCS
1997
Springer

213views Applied Computing» more ISTCS 1997»

Weak Alternating Automata Are Not That Weak

13 years 8 months ago