2698 search results - page 128 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
168
click to vote
FOCS
2008
IEEE
16 years 26 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
167
click to vote
TROB
2008
15 years 4 months ago
2008
SLAM algorithms based on local maps have been demonstrated to be well suited for mapping large environments as they reduce the computational cost and improve the consistency of the...
203
click to vote
IDA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Independent Subspace Analysis (ISA) is an extension of Independent Component Analysis (ICA) that aims to linearly transform a random vector such as to render groups of it...
194
click to vote
ECCC
2011
15 years 1 months ago
2011
We consider two basic computational problems regarding discrete probability distributions: (1) approximating the statistical difference (aka variation distance) between two given d...
143
click to vote
WABI
2007
Springer
16 years 15 days ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...