1059 search results - page 8 / 212 » Improved Algorithms via Approximations of Probability Distri... |
AAAI
1997
13 years 9 months ago
1997
We present empirical evidence that the distribution of e ort required to solve CSPs randomly generated at the 50% satis able point, when using a backtracking algorithm, can be app...
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper presents a powerful variant of the ICP (Iterative Closest Point) algorithm for registering range images using a probability field. The probability field (p-field) repre...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper we present an approach for localizing a sensor network augmented with a mobile robot which is capable of providing inter-sensor pose estimates through its odometr...
PKDD
2007
Springer
14 years 1 months ago
2007
Springer
The goal in domain adaptation is to train a model using labeled data sampled from a domain different from the target domain on which the model will be deployed. We exploit unlabel...