Talya Eden

Learn More
We consider the problem of estimating the number of triangles in a graph. This problem has been extensively studied in both theory and practice, but all existing algorithms read the entire graph. In this work we design a sublinear-time algorithm for approximating the number of triangles in a graph, where the algorithm is given query access to the graph. The(More)
A separation of the longitudinal and transverse 12 C(e,eЈp) cross sections in the quasifree region has been performed in parallel kinematics at Q 2 of 0.64 and 1.8 GeV 2 for initial proton momentum Ͻ80 MeV. The separated transverse and longitudinal spectral functions at Q 2 ϭ0.64 GeV 2 show significant differences for missing energy between 25 and 60 MeV(More)
We revisit the classic problem of estimating the degree distribution moments of an undirected graph. Consider an undirected graph G = (V, E) with n (non-isolated) vertices, and define (for s > 0) µ s = 1 n · v∈V d s v. Our aim is to estimate µ s within a multiplicative error of (1 + ε) (for a given approximation parameter ε > 0) in sublinear time. We(More)
The function f : {−1, 1} n → {−1, 1} is a k-junta if it depends on at most k of its variables. We consider the problem of tolerant testing of k-juntas, where the testing algorithm must accept any function that is ǫ-close to some k-junta and reject any function that is ǫ ′-far from every k ′-junta for some ǫ ′ = O(ǫ) and k ′ = O(k). Our first result is an(More)
  • E Arthurs, F J M Wozencraft, R M Jelinek, M Fano, T Eden, J B Kailath +19 others
  • 2009
This group continues its investigations of sources that generate information, channels that transmit it, and machines that process it. For sources, the main objective is to estimate the rate at which they generate information and to determine how to encode their output economically, in order to decrease the channel capacity required for transmission.(More)
  • 1