1963 search results - page 270 / 393 » The Maximum Solution Problem on Graphs |
138
Voted
ACST
2006
15 years 2 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
115
click to vote
DAM
1999
15 years 10 days ago
1999
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...
120
Voted
ICDM
2009
IEEE
14 years 10 months ago
2009
IEEE
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
103
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
119
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...