نتائج البحث

A An In-Depth Analysis of Stochastic Kronecker Graphs C. SESHADHRI, Sandia National Laboratories

• Authors : Ali Pinar; Ia National Laboratories; Tamara G. Kolda ...

Subjects: Categories and Subject Descriptors; D.2.8 [Software Engineering; Metrics—complexity measures

• Source: http://csmr.ca.sandia.gov/%7Etgkolda/pubs/bibtgkfiles/SKG-arXiv-1102.5046v3.pdf.

تفاصيل العنوان

An In-Depth Analysis of Stochastic Kronecker Graphs 1 C. SESHADHRI, Sandia National Laboratories ALI PINAR, Sandia National Laboratories

• Authors : Tamara G. Kolda; Ia National Laboratories; The Pennsylvania State University CiteSeerX Archives

Subjects: Categories and Subject Descriptors; D.2.8 [Software Engineering; Metrics—complexity measures

• Source: http://csmr.ca.sandia.gov/%7Etgkolda/pubs/bibtgkfiles/SKG-arXiv-1102.5046v2.pdf.

تفاصيل العنوان

Decompositions of triangle-dense graphs

• Authors : Rishi Gupta; Tim Roughgarden; C. Seshadhri ...

• Source: http://theory.stanford.edu/~tim/papers/triangle.pdf.

تفاصيل العنوان

Is Submodularity Testable?

• Authors : C. Seshadhri; Jan Vondrák; The Pennsylvania State University CiteSeerX Archives

• Source: http://theory.stanford.edu/~jvondrak/data/submod-testing-alg.pdf.

تفاصيل العنوان

Triadic measures on graphs: the power of wedge sampling

• Authors : C. Seshadhri; Ali Pinar; Tamara G. Kolda ...

Subjects: World Wide Web; computer traffic; molecular interac

• Source: http://www.cs.princeton.edu/~csesha/pubs/conf-wedge-sampling.pdf.

تفاصيل العنوان

An optimal lower bound for monotonicity testing over hypergrids

• Authors : Deeparnab Chakrabarty; C. Seshadhri; The Pennsylvania State University CiteSeerX Archives

Subjects: Monotonicity testing; sublinear algorithms; lower bounds

• Source: http://www.cs.princeton.edu/~csesha/pubs/conf-mono-lb.pdf.

تفاصيل العنوان

COUNTING TRIANGLES IN MASSIVE GRAPHS WITH MAPREDUCE

• Authors : Tamara G. Kolda; Ali Pinar; Todd Plantenga ...

Subjects: triangle counting; clustering coefficient; triangle characteristics

• Source: http://csmr.ca.sandia.gov/%7Etgkolda/pubs/bibtgkfiles/TriMR-arXiv-1301.5887v1.pdf.

تفاصيل العنوان

Optimal bounds for monotonicity and Lipschitz testing over the hypercube and hypergrids

• Authors : Deeparnab Chakrabarty; C. Seshadhri; The Pennsylvania State University CiteSeerX Archives

Subjects: ics; Combinatorics—Combinatorial algorithms General Terms

• Source: http://www.cs.princeton.edu/~csesha/pubs/conf-derivative-testing.pdf.

تفاصيل العنوان

Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls ∗

• Authors : Kenneth L. Clarkson; Wolfgang Mulzer; C. Seshadhri ...

• Source: http://page.mi.fu-berlin.de/mulzer/pubs/simsich.pdf.

تفاصيل العنوان

Finding Cycles and Trees in Sublinear Time

• Authors : Artur Czumaj; Oded Goldreich; Dana Ron ...

Subjects: Sublinear-Time Algorithms; Property Testing; Bounded-Degree Graphs

• Source: http://www.wisdom.weizmann.ac.il/~oded/PDF/minor-rev.pdf.

تفاصيل العنوان