Sciweavers

1760 search results - page 110 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
INFOCOM
2008
IEEE
15 years 11 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
133
Voted
EPIA
2005
Springer
15 years 10 months ago
CONAN: An Integrative System for Biomedical Literature Mining
The amount of information about the genome, transcriptome and proteome, forms a problem for the scientific community: how to find the right information in a reasonable amount of ...
Rainer Malik, Arno Siebes
TSP
2008
106views more  TSP 2008»
15 years 4 months ago
Identification of Matrices Having a Sparse Representation
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
Götz E. Pfander, Holger Rauhut, Jared Tanner
148
Voted
CORR
2011
Springer
162views Education» more  CORR 2011»
14 years 12 months ago
Helly numbers of acyclic families
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...
Éric Colin de Verdière, Grégo...
166
Voted
DATAMINE
2010
166views more  DATAMINE 2010»
15 years 5 months ago
Optimal constraint-based decision tree induction from itemset lattices
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
Siegfried Nijssen, Élisa Fromont