Sciweavers

4926 search results - page 628 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
89
Voted
EOR
2008
52views more  EOR 2008»
15 years 2 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
123
Voted
CVPR
2005
IEEE
16 years 4 months ago
Tracking Multiple Mouse Contours (without Too Many Samples)
We present a particle filtering algorithm for robustly tracking the contours of multiple deformable objects through severe occlusions. Our algorithm combines a multiple blob track...
Kristin Branson, Serge Belongie
142
Voted
CVPR
2006
IEEE
16 years 4 months ago
Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation and Occlusion Handling
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...
Qingxiong Yang, Liang Wang, Ruigang Yang, Henrik S...
CGA
2007
15 years 2 months ago
Fast Simulation of Laplacian Growth
— Laplacian instability is the physical mechanism that drives pattern formation in many disparate natural phenomena. However, current algorithms for simulating this instability a...
Theodore Kim, Jason Sewall, Avneesh Sud, Ming C. L...
134
Voted
MP
2002
143views more  MP 2002»
15 years 2 months ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck