986 search results - page 114 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
223
click to vote
ACID
2006
15 years 5 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
132
Voted
PODS
2005
ACM
16 years 4 months ago
2005
ACM
All known algorithms for evaluating advanced XPath queries (e.g., ones with predicates or with closure axes) on XML streams employ buffers to temporarily store fragments of the do...
151
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
138
Voted
ALGORITHMICA
1998
15 years 3 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
137
Voted
SODA
2010
ACM
16 years 1 months ago
2010
ACM
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...