• Publications
  • Influence
Truth revelation in approximately efficient combinatorial auctions
TLDR
We show that the GVA payment scheme does not provide for a truth revealing mechanism for combinatorial auctions. Expand
  • 536
  • 58
  • PDF
Streaming-data algorithms for high-quality clustering
TLDR
We provide a streaming algorithm that effectively clusters large data streams and provide theoretical guarantees on its performance. Expand
  • 626
  • 45
  • PDF
Clustering Data Streams
TLDR
We study clustering under the data stream model of computation where: given a sequence of points, the objective is to maintain a consistently good clustering of the sequence observed so far. Expand
  • 745
  • 43
  • PDF
Clustering Data Streams: Theory and Practice
TLDR
We present a streaming algorithm that effectively clusters large data streams and provide empirical evidence of its performance. Expand
  • 882
  • 39
  • PDF
Truth revelation in approximately efficient combinatorial auctions
TLDR
We show that the GVA payment scheme does not provide for a truth revealing mechanism for combinatorial auctions. Expand
  • 277
  • 21
Better streaming algorithms for clustering problems
TLDR
We study clustering problems in the streaming model, where the goal is to cluster a set of points by making one pass (or a few passes) over the data using a small amount of storage space using a randomized algorithm which produces a constant factor approximation in one pass using storage space O(k poly log n). Expand
  • 282
  • 18
  • PDF
Maintaining variance and k-medians over data stream windows
TLDR
We present a novel technique for solving two important and related problems in the sliding window model---maintaining variance and maintaining a <i>k</i>--median clustering. Expand
  • 323
  • 14
  • PDF
A k-Median Algorithm with Running Time Independent of Data Size
TLDR
We give a sampling-based algorithm for the k-Median problem, with fully polynomial running time that is independent of n, the size of the data set. Expand
  • 52
  • 3
  • PDF
Computing Shortest Paths with Uncertainty
TLDR
We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Expand
  • 20
  • PDF
Querying priced information in databases: The conjunctive case
Query optimization that involves expensive predicates has received considerable attention in the database community. Typically, the output to a database query is a set of tuples that satisfy certainExpand
  • 5
  • PDF