Sciweavers

5138 search results - page 331 / 1028
» Randomized Algorithms for 3-SAT
Sort
View
ICCV
2009
IEEE
15 years 4 months ago
Consensus set maximization with guaranteed global optimality for robust geometry estimation
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
Hongdong Li
AISS
2010
161views more  AISS 2010»
15 years 4 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
IMCSIT
2010
15 years 3 months ago
Effectiveness of Solving Traveling Salesman Problem Using Ant Colony Optimization on Distributed Multi-Agent Middleware
Recently we have setup the goal of investigating new truly distributed forms of Ant Colony Optimization. We proposed a new distributed approach for Ant Colony Optimization (ACO) al...
Sorin Ilie, Costin Badica
CIAC
2010
Springer
281views Algorithms» more  CIAC 2010»
15 years 3 months ago
Parameterized Complexity of Even/Odd Subgraph Problems
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
Leizhen Cai, Boting Yang
CVPR
2012
IEEE
13 years 9 months ago
Incremental gradient on the Grassmannian for online foreground and background separation in subsampled video
It has recently been shown that only a small number of samples from a low-rank matrix are necessary to reconstruct the entire matrix. We bring this to bear on computer vision prob...
Jun He, Laura Balzano, Arthur Szlam