1632 search results - page 161 / 327 » On special numberings of hypergraphs |
144
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
167
click to vote
APPROX
2010
Springer
15 years 8 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
193
click to vote
WALCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
Due to the recent growth in the demand of mobile communication services in several typical environments, the development of efficient systems for providing specialized services ha...
191
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: False discovery rate (FDR) methods play an important role in analyzing highdimensional data. There are two types of FDR, tail area-based FDR and local FDR, as well as ...
171
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: With the amount of influenza genome sequence data growing rapidly, researchers need machine assistance in selecting datasets and exploring the data. Enhanced visualiza...