2403 search results - page 183 / 481 » Optimal Randomized RANSAC |
120
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
An erasure channel with a fixed alphabet size q, where q 1, is studied . It is proved that over any erasure channel (with or without memory), Maximum Distance Separable (MDS) codes...
121
Voted
JSAC
2008
15 years 3 months ago
2008
Abstract-- This paper considers the integration of communication and control with respect to the task of coordinated heading control for a group of N vehicles. The heading control ...
159
Voted
HEURISTICS
1998
15 years 3 months ago
1998
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
202
Voted
TELSYS
2011
14 years 10 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
111
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Recent research has revealed that circularity (or, propriety) of complex random signals can be exploited in developing optimal signal processors. In this paper, a robust estimator...