Sciweavers

3874 search results - page 501 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
ICTAI
2007
IEEE
15 years 11 months ago
Photometric Invariant Projective Registration Using ECC Maximization
The ability of an algorithm to accurately estimate the parameters of the geometric transformation which aligns two image profiles even in the presence of photometric distortions ...
Georgios D. Evangelidis, Emmanouil Z. Psarakis
TCS
2010
15 years 3 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
135
Voted
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
15 years 9 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 5 months ago
Bidimensionality and EPTAS
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
POPL
2003
ACM
16 years 5 months ago
A generic approach to the static analysis of concurrent programs with procedures
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...
Ahmed Bouajjani, Javier Esparza, Tayssir Touili