1952 search results - page 250 / 391 » Complete partitions of graphs |
163
click to vote
RE
2002
Springer
15 years 6 months ago
2002
Springer
This paper presents an extended version of GoalOriented Requirements Analysis Method called AGORA, where attribute values, e.g. contribution values and preference matrices, are ad...
183
click to vote
NETWORKS
2010
15 years 4 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
174
click to vote
BMVC
2010
15 years 4 months ago
2010
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
279
click to vote
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...
286
click to vote
MST
2011
14 years 9 months ago
2011
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...