279 search results - page 7 / 56 » Approximating Average Parameters of Graphs |
FSTTCS
2004
Springer
14 years 28 days ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
ACG
2006
Springer
14 years 1 months ago
2006
Springer
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization a...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
12 In this paper we study the problem of shape analysis and its application in locating facial feature points on frontal faces. We propose a Bayesian inference solution based on ta...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper we study decentralized, networked systems whose interaction dynamics are given by a nearestneighbor averaging rule. By letting one node in the network take on the rol...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...