140 search results - page 25 / 28 » Computing the visibility graph of points within a polygon |
181
click to vote
MOBIHOC
2005
ACM
16 years 4 months ago
2005
ACM
Determining node and event locations is a canonical task for many wireless network applications. Yet dedicated infrastructure for determining position information is expensive, en...
154
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
142
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
170
click to vote
IEEEMSP
2002
IEEE
15 years 9 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
191
click to vote
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...