Sciweavers

986 search results - page 61 / 198
» Algorithmic Lower Bounds for Problems Parameterized by Cliqu...
Sort
View
92
Voted
AAECC
2006
Springer
79views Algorithms» more  AAECC 2006»
15 years 9 months ago
New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
Moshe Schwartz, Alexander Vardy
152
Voted
JCSS
2002
95views more  JCSS 2002»
15 years 3 months ago
Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...
Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
FOCS
2005
IEEE
15 years 9 months ago
The Parking Permit Problem
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
Adam Meyerson
105
Voted
FOCS
2009
IEEE
15 years 10 months ago
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei...
COCOON
2004
Springer
15 years 7 months ago
k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu