12519 search results - page 209 / 2504 » Approximation Problems Categories |
156
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
166
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
162
click to vote
SIGECOM
2005
ACM
16 years 1 days ago
2005
ACM
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
150
click to vote
AIRWEB
2005
Springer
16 years 1 days ago
2005
Springer
This paper investigates the influence of different page features on the ranking of search engine results. We use Google (via its API) as our testbed and analyze the result rankin...
166
click to vote
CIKM
2004
Springer
15 years 12 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 (...