1866 search results - page 135 / 374 » Robust Algorithms and Price of Robustness in Shunting Proble... |
171
click to vote
SIAMIS
2010
15 years 28 days ago
2010
We study geometric reconstruction problems in one-dimensional retina vision. In such problems, the scene is modeled as a 2D plane, and the camera sensor produces 1D images of the s...
156
click to vote
GECCO
2007
Springer
16 years 10 days ago
2007
Springer
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
130
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
171
click to vote
IJIS
2007
15 years 6 months ago
2007
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
163
click to vote
SIGPRO
2008
15 years 6 months ago
2008
The LMS algorithm is one of the most popular learning algorithms for identifying an unknown system. Many variants of the algorithm have been developed based on different problem f...