2031 search results - page 402 / 407 » On Tree-Constrained Matchings and Generalizations |
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
MM
2009
ACM
14 years 2 months ago
2009
ACM
This paper presents an efficient, personalizable and yet completely automatic algorithm for enhancing the brightness, tonal balance, and contrast of faces in thumbnails of online...
MM
2009
ACM
14 years 2 months ago
2009
ACM
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
WWW
2009
ACM
14 years 2 months ago
2009
ACM
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...