N. Alon, S. Ben-David, N. Ceqa-Bianchi, D. Haussler, Scale-sensitive dimensions, unitbrm cinvergence, and learnability, Proc. 341h Annual Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 292-301. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Testing Subgraphs in Directed Graphs - Alon, Shapira (2003) (2 citations) Self-citation (Alon) (Correct)
....implicitly proven already in [13] for k = 2 and in [27] see also [2] for general k, using the Regularity Lemma of Szemeredi [30] but in the context of property testing it is first studied in [21] where far more e#cient algorithms are described. These have been further improved in [7] In [5] it is shown that every first order graph property without a quantifier alternation of type ## has # testers whose query complexity is independent of the size of the input graph (but has a huge dependence on #) In [1] it is shown that there is a one sided error # tester for checking H freeness ....
....[30] adapted for directed graphs, which we formulate and prove. This version of the regularity lemma might prove useful for other problems. The application for getting the strong testability of each property PH is similar to the proof for the undirected case, given (implicitly) in [2] see also [5], 1] The one sided # tester for PH for arbitrary digraphs H, has query complexly bounded by a function which, though independent of the size of the input digraph G, has a huge dependency on # and the size of H. For some digraphs H, however, there are more e#cient # testers; for example, if H is ....
[Article contains additional citation context not shown here]
N. Alon, E. Fischer, M. Krivelevich and M. Szegedy, E#cient testing of large graphs, Proc. 40 Annual Symp. on Foundations of Computer Science (FOCS), New York, NY, IEEE (
The degree of sets in Euclidian space using sets with.. - Maiorov, Ratsaby (1998) (Correct)
No context found.
N. Alon, S. Ben-David, N. Ceqa-Bianchi, D. Haussler, Scale-sensitive dimensions, unitbrm cinvergence, and learnability, Proc. 341h Annual Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 292-301.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC