7129 search results - page 310 / 1426 » Approximation Algorithms for Treewidth |
167
Voted
SIGMOD
2011
ACM
14 years 7 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
155
click to vote
ISAAC
2000
Springer
15 years 8 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
166
click to vote
ALGORITHMICA
2006
15 years 4 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
140
click to vote
ALT
2004
Springer
16 years 1 months ago
2004
Springer
We consider a two-layer network algorithm. The first layer consists of an uncountable number of linear units. Each linear unit is an LMS algorithm whose inputs are first “kerne...
138
click to vote
ISPAN
1997
IEEE
15 years 8 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...