1554 search results - page 103 / 311 » Parameterized Complexity and Approximation Algorithms |
105
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
128
click to vote
ECCC
2000
15 years 3 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
103
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
122
click to vote
BIODATAMINING
2008
15 years 4 months ago
2008
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
142
click to vote
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...