Sciweavers

5595 search results - page 931 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
STOC
2010
ACM
194views Algorithms» more  STOC 2010»
15 years 11 months ago
Multi-parameter mechanism design and sequential posted pricing
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
Shuchi Chawla, Jason Hartline, David Malec and Bal...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 10 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
220
Voted
FOCS
2000
IEEE
15 years 10 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
15 years 10 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
15 years 10 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla