19320 search results - page 3524 / 3864 » On the complexity of computing determinants |
199
Voted
IJCV
2002
15 years 6 months ago
2002
We present a new feature based algorithm for stereo correspondence. Most of the previous feature based methods match sparse features like edge pixels, producing only sparse dispar...
210
Voted
AI
1999
Springer
15 years 6 months ago
1999
Springer
In this paper, we first discuss the meaning of physical embodiment and the complexity of the environment in the context of multi-agent learning. We then propose a vision-based rei...
187
click to vote
AROBOTS
1999
15 years 6 months ago
1999
Sensing visual motion gives a creature valuable information about its interactions with the environment. Flies in particular use visual motion information to navigate through turbu...
165
click to vote
DAM
1998
15 years 6 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
163
click to vote
DCG
1998
15 years 6 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...