1268 search results - page 122 / 254 » Finding a curve in a map |
166
click to vote
IEAAIE
2004
Springer
15 years 11 months ago
2004
Springer
A fundamental difficulty faced by cooperative multiagent systems is to find how to efficiently coordinate agents. There are three fundamental processes to solve the coordination pr...
149
click to vote
IADIS
2004
15 years 7 months ago
2004
As stated in the Web Content Accessibility Guidelines, it is extremely important to provide clear and consistent navigation mechanisms to increase the likelihood that a person wil...
752
click to vote
Tutorial
Correlation based matching typically produces dense depth maps by calculating the disparity at each pixel within a neighborhood. This is achieved by taking a square window of certa...
174
click to vote
CAL
2002
15 years 6 months ago
2002
This paper presents an algorithm to find a worst-case traffic pattern for any oblivious routing algorithm on an arbitrary interconnection network topology. The linearity of channe...
195
click to vote
MOC
2011
15 years 1 months ago
2011
We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues assoc...