4131 search results - page 482 / 827 » Compactness in Topology and Computation |
192
Voted
CGF
2008
15 years 5 months ago
2008
This paper deals with the reconstruction of 2-dimensional geometric shapes from unorganized 1-dimensional cross-sections. We study the problem in its full generality following the...
194
click to vote
ISVC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). The proposed algorithm aims to recover th...
155
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classe...
146
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
185
click to vote
WIOPT
2010
IEEE
15 years 5 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...