Sciweavers

1086 search results - page 53 / 218
» Jug measuring: Algorithms and complexity
Sort
View
ICDAR
1999
IEEE
14 years 3 months ago
Methodology for Flexible and Efficient Analysis of the Performance of Page Segmentation Algorithms
This paper presents part of a new DIA performance analysis framework aimed at Layout Analysis algorithm developers. A new region-representation scheme (an interval-based descripti...
Apostolos Antonacopoulos, A. Brough
PODC
2010
ACM
14 years 29 days ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
DAC
2004
ACM
14 years 12 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
ECOWS
2009
Springer
14 years 5 months ago
A Model and Algorithm for Self-Adaptation in Service-oriented Systems
Abstract—In this paper, we address the problem of selfadaptation in internet-scale service-oriented systems. Services need to adapt by select the best neighboring services solely...
Christoph Dorn, Daniel Schall, Schahram Dustdar
JUCS
2010
265views more  JUCS 2010»
13 years 9 months ago
A General Framework for Multi-Human Tracking using Kalman Filter and Fast Mean Shift Algorithms
: The task of reliable detection and tracking of multiple objects becomes highly complex for crowded scenarios. In this paper, a robust framework is presented for multi-Human track...
Ahmed Ali, Kenji Terada