1090 search results - page 76 / 218 » Priority Algorithms for Graph Optimization Problems |
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in so...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
This paper presents a path planner for Unmanned Air Vehicles (UAVs) based on Evolutionary Algorithms (EA) that can be used in realistic risky scenarios. The path returned by the a...
CVPR
2008
IEEE
15 years 7 days ago
2008
IEEE
Accurate estimation of optical flow is a challenging task, which often requires addressing difficult energy optimization problems. To solve them, most top-performing methods rely ...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...