1814 search results - page 290 / 363 » Improved Results on Geometric Hitting Set Problems |
GLOBECOM
2009
IEEE
14 years 4 months ago
2009
IEEE
— There is currently much debate in defining what form the Future Internet will take [22, 23, 24]. The current Internet is struggling to meet the needs of an ever-evolving societ...
EJC
2008
13 years 10 months ago
2008
Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured that if a graph has no odd complete minor of order p, the...
FOCS
2008
IEEE
14 years 4 months 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...
BMCBI
2006
13 years 10 months ago
2006
Background: Single nucleotide polymorphisms (SNP) constitute more than 90% of the genetic variation, and hence can account for most trait differences among individuals in a given ...
SIGIR
2006
ACM
14 years 4 months ago
2006
ACM
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In...