2638 search results - page 129 / 528 » Random Geometric Complexes |
139
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
142
click to vote
SIGACT
2008
15 years 4 months ago
2008
Two long-open problems have been solved: (1) every sufficiently large planar point set in general position contains the vertices of an empty hexagon; (2) every finite collection o...
150
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Image based rendering is an attractive alternative for generating novel views compared to model based rendering due to its lower complexity and potential for photo-realistic resul...
150
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
137
click to vote
INFOCOM
2007
IEEE
15 years 11 months ago
2007
IEEE
— We propose new algorithms to achieve k-coverage in dense sensor networks. In such networks, covering sensor locations approximates covering the whole area. However, it has been...