4865 search results - page 731 / 973 » The Complexity of Graph Connectivity |
155
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
128
click to vote
ICPR
2010
IEEE
15 years 11 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
134
click to vote
SOFSEM
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
131
click to vote
WIAMIS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we consider the challenging problem of object duplicate detection and localization. Several applications require efficient object duplicate detection methods, such ...
125
click to vote
ESWS
2009
Springer
15 years 11 months ago
2009
Springer
As social networks are becoming ubiquitous on the Web, the Semantic Web goals indicate that it is critical to have a standard model allowing exchange, interoperability, transformat...