Sciweavers

2313 search results - page 205 / 463
» On Heuristic Time Hierarchies
Sort
View
WEA
2007
Springer
108views Algorithms» more  WEA 2007»
16 years 21 days ago
Engineering Algorithms for Approximate Weighted Matching
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
Jens Maue, Peter Sanders
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
16 years 19 days ago
Plagiarism Detection in arXiv
We describe a large-scale application of methods for finding plagiarism and self-plagiarism in research document collections. The methods are applied to a collection of 284,834 d...
Daria Sorokina, Johannes Gehrke, Simeon Warner, Pa...
ICMCS
2005
IEEE
68views Multimedia» more  ICMCS 2005»
16 years 5 days ago
On the Performance Improvement of H.264 Through Foreground and Background Analyses
A more efficient coding scheme for H.264 by heuristically assign macroblock partition types for video foreground and background coding is proposed. High visual quality of foregro...
Zhe-Kuan Lin, Horng-Horng Lin, Yu-Hsin Chen, Jen-H...
FCT
2005
Springer
16 years 3 days ago
A Faster and Simpler 2-Approximation Algorithm for Block Sorting
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
Wolfgang W. Bein, Lawrence L. Larmore, Linda Moral...
ICCNMC
2005
Springer
16 years 3 days ago
Least Cost Multicast Spanning Tree Algorithm for Local Computer Network
This study deals with the topology discovery for the capacitated minimum spanning tree network. The problem is composed of finding the best way to link nodes to a source node and, ...
Yong-Jin Lee, Mohammed Atiquzzaman