369 search results - page 63 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
100
Voted
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Particle filtering provides a general framework for propagating probability density functions in non-linear and non-Gaussian systems. However, the algorithm is based on a Monte Ca...
112
click to vote
TOG
2012
13 years 2 months ago
2012
Bubbles and foams are important features of liquid surface phenomena, but they are difficult to animate due to their thin films and complex interactions in the real world. In par...
102
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
108
click to vote
CPM
2005
Springer
15 years 1 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
ICRA
1999
IEEE
15 years 4 months ago
1999
IEEE
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilisticlocalization algorithms known as Monte...