3894 search results - page 460 / 779 » Approximation Algorithms for Biclustering Problems |
160
Voted
SODA
2003
ACM
15 years 6 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
150
click to vote
ICRA
2006
IEEE
15 years 10 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
210
click to vote
FOCS
1997
IEEE
15 years 8 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
141
click to vote
ALT
2008
Springer
16 years 1 months ago
2008
Springer
We propose a new boosting algorithm for bipartite ranking problems. Our boosting algorithm, called SoftRankBoost, is a modification of RankBoost which maintains only smooth distri...
103
click to vote
ICCAD
2003
IEEE
16 years 1 months ago
2003
IEEE
— In this paper we consider the problem of finding a smaller RLCM circuit that approximately replicates the behavior (up to a certain frequency) of a given RLCM circuit. Targeted...