Sciweavers

1090 search results - page 158 / 218
» Priority Algorithms for Graph Optimization Problems
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 5 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
PODC
2011
ACM
12 years 10 months ago
Coordinated consensus in dynamic networks
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
Fabian Kuhn, Rotem Oshman, Yoram Moses
IPPS
2010
IEEE
13 years 5 months ago
Optimization of linked list prefix computations on multithreaded GPUs using CUDA
We present a number of optimization techniques to compute prefix sums on linked lists and implement them on multithreaded GPUs using CUDA. Prefix computations on linked structures ...
Zheng Wei, Joseph JáJá
3DIM
2007
IEEE
14 years 2 months ago
Generalized MPU Implicits Using Belief Propagation
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
Yi-Ling Chen, Shang-Hong Lai, Tung-Ying Lee
MICCAI
2007
Springer
14 years 8 months ago
De-enhancing the Dynamic Contrast-Enhanced Breast MRI for Robust Registration
Abstract. Dynamic enhancement causes serious problems for registration of contrast enhanced breast MRI, due to variable uptakes of agent on different tissues or even same tissues i...
Yuanjie Zheng, Jingyi Yu, Chandra Kambhamettu, Sar...