217 search results - page 36 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
116
click to vote
STOC
2010
ACM
15 years 1 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
Some of the most successful algorithms for the automated segmentation of images use an Active Regions approach, where a curve is evolved so as to maximize the disparity of its int...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
100
click to vote
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
111
click to vote
ECCC
2011
14 years 4 months ago
2011
A family of permutations in Sn is k-wise independent if a uniform permutation chosen from the family maps any distinct k elements to any distinct k elements equally likely. Effici...