25 search results - page 2 / 5 » Tight Lower Bounds for Certain Parameterized NP-Hard Problem... |
135
Voted
COLT
2008
Springer
15 years 3 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
102
click to vote
DAGSTUHL
2006
15 years 2 months ago
2006
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
140
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
125
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
104
click to vote
WDAG
2009
Springer
15 years 7 months ago
2009
Springer
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...