7129 search results - page 1042 / 1426 » Approximation Algorithms for Treewidth |
116
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...
128
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
120
click to vote
CVPR
2010
IEEE
15 years 12 months ago
2010
IEEE
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
135
click to vote
SAC
2009
ACM
15 years 11 months ago
2009
ACM
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
133
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...