1361 search results - page 147 / 273 » Spaces of practice |
110
Voted
IJCAI
1997
15 years 5 months ago
1997
This paper studies constraint satisfaction over connected row-convex (CRC) constraints. It shows that CRC constraints are closed under composition, intersection, and transposition...
147
Voted
SODA
2000
ACM
15 years 5 months ago
2000
ACM
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
187
Voted
IJCAI
1989
15 years 4 months ago
1989
This paper explores the realization of robotic arm motion planning, especially Findpath Problem, which is a basic motion planning problem that arises in the development of robotic...
132
Voted
ICASSP
2010
IEEE
15 years 3 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
109
Voted
CGF
2010
15 years 3 months ago
2010
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...