483 search results - page 67 / 97 » On perfectness of sums of graphs |
ISAAC
2005
Springer
15 years 4 months ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
ICDAR
2011
IEEE
13 years 10 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
112
click to vote
CVPR
2012
IEEE
13 years 1 months ago
2012
IEEE
This paper addresses recognition of human activities with stochastic structure, characterized by variable spacetime arrangements of primitive actions, and conducted by a variable ...
128
click to vote
ECCC
2007
14 years 10 months ago
2007
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
STOC
2007
ACM
15 years 11 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...