10805 search results - page 380 / 2161 » Mapping Computation with No Memory |
142
click to vote
ICPR
2010
IEEE
16 years 1 months ago
2010
IEEE
We consider a simple statistical model of the image, in which the image is represented as a sum of two parts: one part is explained by an i.i.d. color Gaussian mixture and the oth...
123
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper studies the problem of mobile robot mapbuilding using a low-accuracy RFID sensor. In recent years, there has been increasing number of mobile robot systems using RFID l...
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...
151
click to vote
IPPS
1993
IEEE
15 years 11 months ago
1993
IEEE
We show the universality of the VEDIC network in simulating other well known interconnection networks by generating the parameters of the VEDtC network automatically. Algorithms a...
206
click to vote
SI3D
2009
ACM
16 years 1 months ago
2009
ACM
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...