Samira Daruki
PhD student


Book Chapter  Journal  Conference  Workshop  Tech Report]

Journal

2016

  • Streaming Verification of Graph Properties. (Project Website)
    By Amirali Abdullah,   Samira Daruki,   Chitradeep Dutta Roy,   Suresh Venkatasubramanian,   
    Vol.abs/1602.08162, CoRR (CORR 2016),  2016.
    Abstract
  • 2015

  • Streaming Verification in Data Analysis. (Project Website)
    By Samira Daruki,   Justin Thaler,   Suresh Venkatasubramanian,   
    Vol.abs/1509.05514, CoRR (CORR 2015),  2015.
    Abstract
  • Conference

    2016

  • Streaming Verification of Graph Properties. (Project Website)
    By Amirali Abdullah,   Samira Daruki,   Chitradeep Dutta Roy,   Suresh Venkatasubramanian,   
    In Proceedings of ISAAC (ISAAC 2016),  pages 3:1-3:14,  2016.
    Abstract
  • 2015

  • Streaming Verification in Data Analysis. (Project Website)
    By Samira Daruki,   Justin Thaler,   Suresh Venkatasubramanian,   
    In Proceedings of ISAAC (ISAAC 2015),  pages 715-726,  2015.
    Abstract
  • 2013

  • Range Counting Coresets for Uncertain Data
    By Amirali Abdullah,    Samira Daruki,    and Jeff M. Phillips
    (To Appear) In Proceedings of 29th Annual ACM Symposium on Computational Geometry (SOCG),  pages ??-??,  June,  2013.
    Abstract

    We study coresets for various types of range counting queries on uncertain data. In our model each uncertain point has a probability density describing its location, sometimes defined as k distinct locations. Our goal is to construct a subset of the uncertain points, including their locational uncertainty, so that range counting queries can be answered by just examining this subset. We study three distinct types of queries. RE queries return the expected number of points in a query range. RC queries return the number of points in the range with probability at least a threshold. RQ queries returns the probability that fewer than some threshold fraction of the points are in the range. In both RC and RQ coresets the threshold is provided as part of the query. And for each type of query we provide coreset constructions with approximation-size tradeoffs. We show that random sampling can be used to construct each type of coreset, and we also provide significantly improved bounds using discrepancy-based approaches on axis-aligned range queries.

  • Track estimation using link line crossing information in wireless networks. (Project Website)
    By Peter Hillyard,   Samira Daruki,   Neal Patwari,   Suresh Venkatasubramanian,   
    In Proceedings of GlobalSIP (GLOBALSIP 2013),  pages 1037-1040,  2013.
    Abstract