164 search results - page 25 / 33 » Outlier-Robust Convex Segmentation |
113
Voted
ICCSA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
109
Voted
DAC
2010
ACM
15 years 4 months ago
2010
ACM
The identification of speedpaths is required for post-silicon (PS) timing validation, and it is currently becoming timeconsuming due to manufacturing variations. In this paper we...
195
Voted
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
193
Voted
GIS
2008
ACM
16 years 1 months ago
2008
ACM
Multi-dimensional spatial data are obtained when a number of data acquisition devices are deployed at different locations to measure a certain set of attributes of the study subje...
129
Voted
SOFSEM
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we deal with making drawings of clustered hierarchical graphs nicer. Given a planar graph G = (V, E) with an assignment of the vertices to horizontal layers, a plane ...