6365 search results - page 316 / 1273 » Fast Local Computation Algorithms |
133
click to vote
ICRA
2005
IEEE
16 years 9 days ago
2005
IEEE
— Minimum distance localization is the problem of finding the shortest possible path for a robot to eliminate ambiguity regarding its position in the environment. We consider th...
167
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
When modeling high-dimensional richly structured data, it is often the case that the distribution defined by the Deep Boltzmann Machine (DBM) has a rough energy landscape with man...
182
click to vote
MOBIHOC
2003
ACM
16 years 6 months ago
2003
ACM
It is often useful to know the geographic positions of nodes in a communications network, but adding GPS receivers or other sophisticated sensors to every node can be expensive. W...
170
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
182
click to vote
SMA
1995
ACM
15 years 10 months ago
1995
ACM
: Fast and accurate collision detection between general solid models is a fundamental problem in solid modeling, robotics, animation and computer-simulated environments. Most of th...