554 search results - page 66 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
ICIP
2006
IEEE
14 years 10 months ago
2006
IEEE
This paper presents a novel method for efficient boundary based shapes matching and retrieval in presence of occlusion. In this method, the geometric and topological information o...
CVPR
2011
IEEE
13 years 13 days ago
2011
IEEE
Spatial Pyramid Representation (SPR) is a widely used method for embedding both global and local spatial information into a feature, and it shows good performance in terms of gene...