1243 search results - page 83 / 249 » On the locality of bounded growth |
169
click to vote
3DIM
2005
IEEE
15 years 12 months ago
2005
IEEE
The computational cost of a collision detection (CD) algorithm on polygonal surfaces depends highly on the complexity of the models. A novel “locally refined” approach is intr...
163
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Occlusions provide critical cues about the 3D structure of man-made and natural scenes. We present a mathematical framework and algorithm to detect and localize occlusions in image...
192
click to vote
ICCCN
2007
IEEE
15 years 10 months ago
2007
IEEE
Wireless sensor networks (WSNs) introduce new challenges to topology control due to the prevalence of lossy links. We propose a new topology control formulation for lossy WSNs that...
173
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...
173
click to vote
IJAC
2008
15 years 6 months ago
2008
Abstract. A regular set of words is (k-)locally testable if membership of a word in the set is determined by the nature of its subwords of some bounded length k. In this article we...