Sciweavers

ALT
1998
Springer
14 years 3 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
ISAAC
2007
Springer
131views Algorithms» more  ISAAC 2007»
14 years 5 months ago
On the Fault Testing for Reversible Circuits
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
Satoshi Tayu, Shigeru Ito, Shuichi Ueno
ICDT
2009
ACM
148views Database» more  ICDT 2009»
14 years 11 months ago
Tight results for clustering and summarizing data streams
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
Sudipto Guha