370 search results - page 38 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
108
click to vote
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
131
click to vote
EVOW
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. Real-world optimization problems are often subject to uncertainties, which can arise regarding stochastic model parameters, objective functions and decision variables. Th...
139
click to vote
ALGORITHMICA
2008
15 years 2 months ago
2008
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
128
click to vote
DAGM
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...