Articles on Massive Data Sets

• Clustering Algorithms for Random and Pseudo-random Structures
  
  Pradipta Mitra
  
  

  ---

  
  
• A new approach to the planted clique problem
  
  Alan Frieze and Ravi Kannan
  
  

  ---

  
  
• Finding Frequent Elements in non-bursty Streams
  
  Rina Panigrahy and Dilys Thomas
  
  

  ---

  
  
• Secure Multiparty Computation of Approximations
  
  Joan Feigenbaum , Yuval Ishai , Tal Malkin , Kobbi Nissim , Rebecca N. Wright and Martin J. Strauss
  
  

  ---

  
  
• Finding Highly Correlated Pairs Efficiently with Powerful Pruning
  
  Jian Zhang and Joan Feigenbaum
  
  

  ---

  
  
• Spectral Clustering by Recursive Partitioning
  
  Anirban Dasgupta , John Hopcroft , Ravi Kannan and Pradipta Mitra
  
  

  ---

  
  
• Pass-Efficient Algorithms for Clustering
  
  Kevin Chang
  
  

  ---

  
  
• Entropy based Nearest Neighbor Search in High Dimensions
  
  Rina Panigrahy
  
  

  ---

  
  
• Dynamic Tables: An Architecture for Managing Evolving, Heterogeneous Biomedical Data in Relational Database Management Systems
  
  John Corwin , Avi Silberschatz , Perry L. Miller and Luis Marenco
  
  

  ---

  
  
• A Randomized Algorithm for a Tensor-Based Generalization of the Singular Value Decomposition
  
  Petros Drineas and Michael W. Mahoney
  
  

  ---

  
  
• Spectral Clustering with Limited Independence
  
  Anirban Dasgupta , John Hopcroft , Ravi Kannan and Pradipta Mitra
  
  

  ---

  
  
• Pass-Efficient Algorithms for Facility Location
  
  Kevin Chang
  
  

  ---

  
  
• On the Worst Case Complexity of the k-means Method
  
  David Athur and Sergei Vassilvitskii
  
  

  ---

  
  
• Massive Data Streams in Graph Theory and Computational Geometry
  
  Jian Zhang
  
  

  ---

  
  
• A Divide-and-Merge Methodology for Clustering
  
  David Cheng , Ravi Kannan , Santosh Vempala and Grant Wang
  
  

  ---

  
  
• The Space Complexity of Pass-Efficient Algorithms for Clustering
  
  Kevin Chang and Ravi Kannan
  
  

  ---

  
  
• On the Nystrom Method for Approximating a Gram Matrix for Improved Kernel-Based Learning
  
  Petros Drineas and Michael W. Mahoney
  
  

  ---

  
  
• Graph Distances in the Streaming Model: The Value of Space
  
  Joan Feigenbaum , Sampath Kannan , Andrew McGregor , Siddharth Suri and Jian Zhang.
  
  

  ---

  
  
• Computing Diameter in the Streaming and Sliding-Window Models
  
  Joan Feigenbaum , Sampath Kannan and Jian Zhang
  
  

  ---

  
  
• Learning-Based Anomaly Detection in BGP Updates
  
  Jian Zhang , Jennifer Rexford and Joan Feigenbaum
  
  

  ---

  
  
• Fast Monte Carlo Algorithms for Matrices III: Computing an Efficient Approximate Decomposition of a Matrix
  
  Petros Drineas , Ravi Kannan and Michael W. Mahoney
  
  

  ---

  
  
• Fast Monte Carlo Algorithms for Matrices II: Computing Low-Rank Approximations to a Matrix
  
  Petros Drineas , Ravi Kannan and Michael W. Mahoney
  
  

  ---

  
  
• Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication
  
  Petros Drineas , Ravi Kannan and Michael W. Mahoney
  
  

  ---

  
  
• On the Streaming Model Augmented with a Sorting Primitive
  
  Gagan Aggarwal , Mayur Datar , Sridhar Rajagopalan and Matthias Ruhl
  
  

  ---

  
  
• Operator scheduling in data stream systems
  
  Brian Babcock , Shivnath Babu , Mayur Datar , Rajeev Motwani and Dilys Thomas
  
  

  ---

  
  
• Sampling Sub-problems of Heterogeneous Max-Cut Problems and Approximation Algorithms
  
  Petros Drineas , Ravi Kannan and Michael W. Mahoney
  
  

  ---

  
  
• Scale Free Aggregation in Sensor Networks
  
  M. Enachescu , A. Goel , R. Govindan and Rajeev Motwani
  
  

  ---

  
  
• Load Shedding Techniques for Aggregation Queries in Stream Systems
  
  Brian Babcock , Mayur Datar and Rajeev Motwani
  
  

  ---

  
  
• Approximate Counts and Quantiles over Sliding Windows
  
  A Arasu and G. S. Manku
  
  

  ---

  
  
• Connection Subgraphs in Social Networks
  
  Christos Faloutsos , Kevin S. McCurley and Andrew Tomkins
  
  

  ---

  
  
• On Graph Problems in a Semi-Streaming Model
  
  Joan Feigenbaum , Sampath Kannan , Andrew McGregor , Siddharth Suri and Jian Zhang
  
  

  ---

  
  
• Efficient Algorithms for Constructing (1+\epsilon,\beta)-Spanners in the Distributed and Streaming Models
  
  Michael Elkin and Jian Zhang
  
  

  ---

  
  
• Ranking the Web Frontier
  
  Nadav Eiron , Kevin S. McCurley and John A. Tomlin
  
  

  ---

  
  
• Adaptive Ordering of Pipelined Stream Filters
  
  Shivnath Babu , Rajeev Motwani , S. Munagala , J. Niishizawa and Jennifer Widom
  
  

  ---

  
  
• Information technology challenges of biodiversity and ecosystems informatics
  
  John L. Schnase , Judy Cushing , Mike Frame , Anne Frondorf , Eric Landis , David Maier and Avi Silberschatz
  
  

  ---

  
  

Back to publications