5595 search results - page 835 / 1119 » Approximation Algorithms for Clustering Problems |
189
click to vote
COMCOM
2004
15 years 6 months ago
2004
In multihop wavelength division multiplexing systems, a connection between two communication nodes consists of one or more lightpaths. A wavelength conversion is required at the j...
196
click to vote
TCBB
2011
15 years 1 months ago
2011
—We study the problem of merging genetic maps, when the individual genetic maps are given as directed acyclic graphs. The computational problem is to build a consensus map, which...
227
click to vote
JMLR
2012
13 years 9 months ago
2012
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
223
click to vote
PAMI
2011
15 years 1 months ago
2011
—Semi-supervised learning concerns the problem of learning in the presence of labeled and unlabeled data. Several boosting algorithms have been extended to semi-supervised learni...
145
click to vote
AGILE
2009
Springer
16 years 1 months ago
2009
Springer
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...