Sciweavers

561 search results - page 76 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
SAGA
2007
Springer
14 years 1 months ago
Probabilistic Techniques in Algorithmic Game Theory
We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
Spyros C. Kontogiannis, Paul G. Spirakis
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 8 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
14 years 8 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
DCOSS
2006
Springer
13 years 11 months ago
Contour Approximation in Sensor Networks
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
Chiranjeeb Buragohain, Sorabh Gandhi, John Hershbe...
BMCBI
2006
115views more  BMCBI 2006»
13 years 7 months ago
Multivariate curve resolution of time course microarray data
Background: Modeling of gene expression data from time course experiments often involves the use of linear models such as those obtained from principal component analysis (PCA), i...
Peter D. Wentzell, Tobias K. Karakach, Sushmita Ro...