Sciweavers

176 search results - page 16 / 36
» Unbalanced Points and Vertices Problem
Sort
View
CG
2002
Springer
14 years 9 months ago
Towards robust broadcasting of geometry data
We present new algorithms for the robust transmission of geometric data sets, i.e. transmission which allows the receiver to recover (an approximation of) the original geometric o...
Stephan Bischoff, Leif Kobbelt
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 1 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
COMBINATORICS
2002
104views more  COMBINATORICS 2002»
14 years 9 months ago
Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
E. J. Janse van Rensburg, A. Rechnitzer
ECCV
2008
Springer
15 years 11 months ago
Fast Automatic Single-View 3-d Reconstruction of Urban Scenes
We consider the problem of estimating 3-d structure from a single still image of an outdoor urban scene. Our goal is to efficiently create 3-d models which are visually pleasant. W...
Olga Barinova, Vadim Konushin, Anton Yakubenko, Ke...
STAIRS
2008
143views Education» more  STAIRS 2008»
14 years 11 months ago
Domain-Dependent View of Multiple Robots Path Planning
We study a problem of path planning for a group of robots in this paper. The problem is stated as a finding of spatial-temporal paths through which the robots can go from their ini...
Pavel Surynek