3874 search results - page 520 / 775 » Approximation Algorithms for k-hurdle Problems |
118
click to vote
ESA
2007
Springer
15 years 11 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
138
click to vote
CIKM
2004
Springer
15 years 10 months ago
2004
Springer
An important class of queries is the LIKE predicate in SQL. In the absence of an index, LIKE queries are subject to performance degradation. The notion of indexing on substrings (...
146
click to vote
COLT
2003
Springer
15 years 10 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
134
click to vote
PVLDB
2010
15 years 3 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
165
click to vote
TCOM
2010
15 years 3 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....