554 search results - page 13 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
137
click to vote
ICASSP
2011
IEEE
14 years 3 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
FMSD
2008
14 years 11 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
103
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
120
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
EUROPAR
1999
Springer
15 years 4 months ago
1999
Springer
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...