5100 search results - page 271 / 1020 » The Linear Complexity of a Graph |
165
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
161
click to vote
DASFAA
2008
IEEE
15 years 10 months ago
2008
IEEE
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
120
click to vote
ICPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the problem of classification when multiple observations of a pattern are available, possibly under different transformations. We view this problem as a special case o...
140
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....
155
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
In this paper, we propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the...