Sciweavers

Share
SIAMCOMP
2012
7 years 10 months ago
Randomized Competitive Algorithms for Generalized Caching
We consider online algorithms for the generalized caching problem. Here we are given a cache of size k and pages with arbitrary sizes and fetching costs. Given a request sequence ...
Nikhil Bansal, Niv Buchbinder, Joseph Naor
STACS
2012
Springer
8 years 3 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
8 years 11 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu
PODS
2011
ACM
238views Database» more  PODS 2011»
8 years 11 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
FOGA
2011
8 years 11 months ago
The logarithmic hypervolume indicator
It was recently proven that sets of points maximizing the hypervolume indicator do not give a good multiplicative approximation of the Pareto front. We introduce a new “logarith...
Tobias Friedrich, Karl Bringmann, Thomas Voß...
COMPGEOM
2011
ACM
8 years 11 months ago
Zigzag persistent homology in matrix multiplication time
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
COMPGEOM
2011
ACM
8 years 11 months ago
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Several recent works considered cooperative cleaning in static and dynamic environments, which incorporates a swarm of simple robots cleaning an expanding region of contaminated c...
Thilo Beckmann, Rolf Klein, David Kriesel, Elmar L...
COMPGEOM
2011
ACM
8 years 11 months ago
Compressive sensing with local geometric features
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...
Rishi Gupta, Piotr Indyk, Eric Price, Yaron Rachli...
COMPGEOM
2011
ACM
8 years 11 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
books