Sciweavers

263 search results - page 38 / 53
» Combinatorial Shape Decomposition
Sort
View
COMPUTING
2007
97views more  COMPUTING 2007»
14 years 11 months ago
Multiresolution morphing for planar curves
We present a multiresolution morphing algorithm using “as-rigid-as-possible” shape interpolation combinedwithanangle-lengthbasedmultiresolutiondecompositionofsimple2Dpiecewise...
Stefanie Hahmann, Georges-Pierre Bonneau, Baptiste...
ECCV
2002
Springer
16 years 1 months ago
Maximizing Rigidity: Optimal Matching under Scaled-Orthography
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
João Costeira, João Maciel
SECON
2008
IEEE
15 years 6 months ago
Congestion Control and Channel Assignment in Multi-Radio Wireless Mesh Networks
— We address the problem of congestion control in multi-radio, multi-channel, wireless mesh networks. Compared to its single radio counterpart for which solutions exist, this pro...
Anastasios Giannoulis, Theodoros Salonidis, Edward...
IPPS
2007
IEEE
15 years 6 months ago
SWARM: A Parallel Programming Framework for Multicore Processors
Due to fundamental physical limitations and power constraints, we are witnessing a radical change in commodity microprocessor architectures to multicore designs. Continued perform...
David A. Bader, Varun Kanade, Kamesh Madduri
FSTTCS
2007
Springer
15 years 5 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...