986 search results - page 116 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
177
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
224
click to vote
SIGMOD
2012
ACM
13 years 9 months ago
2012
ACM
We study the notion of regret ratio proposed in [19] to deal with multi-criteria decision making in database systems. The regret minimization query proposed in [19] was shown to h...
172
Voted
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
198
click to vote
ISAAC
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
179
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...