4761 search results - page 676 / 953 » Generalizing Boundary Points |
176
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— Navigation and obstacle avoidance in robotics using planar laser scans has matured over the last decades. They basically enable robots to penetrate highly dynamic and populated...
194
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
131
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
One of the most important steps in web crawling is determining the starting points, or seed selection. This paper identifies and explores the problem of seed selection in webscal...
164
click to vote
DAGM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Well known estimation techniques in computational geometry usually deal only with single geometric entities as unknown parameters and do not account for constrained obser...
168
click to vote
GECCO
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...