489 search results - page 58 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
144
Voted
AROBOTS
2006
15 years 3 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
152
Voted
ACM
1995
15 years 7 months ago
1995
We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a...
128
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
124
Voted
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the filter decomposition problem in supporting coarse-grained pipelined parallelism. This form of parallelism is suitable for data-driven applications in scenarios wh...
132
Voted
NIPS
2008
15 years 5 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...