5128 search results - page 317 / 1026 » Discrete Component Analysis |
184
click to vote
COMPGEOM
2003
ACM
16 years 2 days ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
169
click to vote
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
165
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
Detection of obstacles for autonomous vehicles is more difficult when the terrain is not locally planar and remains an open problem. We have developed an approach suited for obsta...
147
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we consider ”wall-bouncing” task in which we repeat the process of hitting the ball that rebounds from the wall and the table as a typical example of dexterous ...
150
click to vote
WSC
2007
15 years 9 months ago
2007
In this paper, air combat simulation data is reconstructed into a dynamic Bayesian network. It gives a compact probabilistic model that describes the progress of air combat and al...