Sciweavers

32 search results - page 3 / 7
» Maintaining a large matching and a small vertex cover
Sort
View
CIKM
1993
Springer
13 years 11 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
ICIP
2005
IEEE
14 years 9 months ago
Motion-compensation using variable-size block-matching with binary partition trees
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
Marc Servais, Theodore Vlachos, Thomas Davies
ICMCS
2006
IEEE
151views Multimedia» more  ICMCS 2006»
14 years 1 months ago
A New Oriented Adaptive Cross Search Algorithm for Block Matching Motion Estimation
Block-matching motion estimation plays an important role in video coding and faster, more robust and more effective search algorithms are needed. Recently, a great number of fast ...
Heng Yang, Qing Wang
PDCN
2004
13 years 8 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
13 years 7 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...