6365 search results - page 465 / 1273 » Fast Local Computation Algorithms |
196
click to vote
ICRA
2000
IEEE
16 years 3 hour ago
2000
IEEE
Autonomous planetary rovers operating in vast unknown environments must operate efficiently because of size, power and computing limitations. Recently, we have developed a rover c...
218
click to vote
CVPR
2009
IEEE
2009
IEEE
Fourier analysis and Gabor filtering for texture analysis and local reconstruction of general shapes
15 years 11 months ago
Since the pioneering work of Gibson in 1950, ShapeFrom-Texture has been considered by researchers as a hard problem, mainly due to restrictive assumptions which often limit its ap...
232
click to vote
MOBIHOC
2006
ACM
16 years 7 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
204
click to vote
SENSYS
2006
ACM
16 years 1 months ago
2006
ACM
The problem of localization in wireless sensor networks where nodes do not use ranging hardware, remains a challenging problem, when considering the required location accuracy, en...
185
click to vote
APPROX
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...