3894 search results - page 424 / 779 » Approximation Algorithms for Biclustering Problems |
150
click to vote
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
159
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
133
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
In this paper we propose algorithms for solving a variety of geometric optimization problems on a stream of points in R2 or R3 . These problems include various extent measures (e.g...
167
click to vote
CVPR
2006
IEEE
16 years 6 months ago
2006
IEEE
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...
145
click to vote
WEA
2007
Springer
15 years 11 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...