Sciweavers

3208 search results - page 638 / 642
» A Lower Bound for Primality
Sort
View
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 5 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ALENEX
2009
172views Algorithms» more  ALENEX 2009»
13 years 5 months ago
Rank Aggregation: Together We're Strong
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
Frans Schalekamp, Anke van Zuylen
DLT
2009
13 years 5 months ago
Crucial Words for Abelian Powers
A word is crucial with respect to a given set of prohibited words (or simply prohibitions) if it avoids the prohibitions but it cannot be extended to the right by any letter of its...
Amy Glen, Bjarni V. Halldórsson, Sergey Kit...
FAST
2009
13 years 5 months ago
Enabling Transactional File Access via Lightweight Kernel Extensions
Transactions offer a powerful data-access method used in many databases today trough a specialized query API. User applications, however, use a different fileaccess API (POSIX) wh...
Richard P. Spillane, Sachin Gaikwad, Manjunath Chi...
CORR
2011
Springer
191views Education» more  CORR 2011»
13 years 2 months ago
On Approximating Four Covering and Packing Problems
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of th...
Mary V. Ashley, Tanya Y. Berger-Wolf, Piotr Berman...