1963 search results - page 64 / 393 » The Maximum Solution Problem on Graphs |
ICASSP
2011
IEEE
13 years 13 days ago
2011
IEEE
A vector-sensor consisting of a monopole sensor collocated with orthogonally oriented dipole sensors can be used for direction-ofarrival (DOA) estimation. A method is proposed to ...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
TIP
2010
13 years 3 months ago
2010
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
STOC
2010
ACM
14 years 1 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...