Sciweavers

1483 search results - page 246 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 6 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
SMA
2009
ACM
149views Solid Modeling» more  SMA 2009»
14 years 3 months ago
A sketching interface for feature curve recovery of free-form surfaces
In this paper, we present a semi-automatic approach to efficiently and robustly recover the characteristic feature curves of a given free-form surface. The technique supports a s...
Ellen Dekkers, Leif Kobbelt, Richard R. Pawlicki, ...
VLSM
2005
Springer
14 years 2 months ago
Incorporating Rigid Structures in Non-rigid Registration Using Triangular B-Splines
For non-rigid registration, the objects in medical images are usually treated as a single deformable body with homogeneous stiffness distribution. However, this assumption is inval...
Kexiang Wang, Ying He 0001, Hong Qin
GLOBECOM
2008
IEEE
14 years 3 months ago
Comparison of Routing and Wavelength Assignment Algorithms in WDM Networks
- We design and implement various algorithms for solving the static RWA problem with the objective of minimizing the maximum number of requested wavelengths based on LP relaxation ...
Kostas Christodoulopoulos, Konstantinos Manousakis...
ICASSP
2010
IEEE
13 years 9 months ago
Best-effort cooperative communication without dedicated relays
Traditional decode-and-forward cooperation systems consider dedicated relays, while instead we consider wireless transceivers that cooperatively relay signals in addition to prima...
Nate Goergen, K. J. Ray Liu, T. Charles Clancy