Sciweavers

ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 3 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
ACIVS
2006
Springer
14 years 3 months ago
Robust Analysis of Silhouettes by Morphological Size Distributions
We address the topic of real-time analysis and recognition of silhouettes. The method that we propose first produces object features obtained by a new type of morphological operato...
Olivier Barnich, Sébastien Jodogne, Marc Va...
COMPGEOM
2000
ACM
14 years 4 months ago
Kinetic connectivity for unit disks
We describe a kinetic data structure (KDS) that maintains the connected components of the union of a set of unit-radius disks moving in the plane. We assume that the motion of eac...
Leonidas J. Guibas, John Hershberger, Subhash Suri...
GMP
2010
IEEE
190views Solid Modeling» more  GMP 2010»
14 years 4 months ago
A Subdivision Approach to Planar Semi-algebraic Sets
Abstract. Semi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a ce...
Angelos Mantzaflaris, Bernard Mourrain
SPAA
2004
ACM
14 years 5 months ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...
ICPR
2008
IEEE
14 years 6 months ago
Text detection from scene images using sparse representation
A sparse representation based method is proposed for text detection from scene images. We start with edge information extracted using Canny operator and then group these edge poin...
Wumo Pan, Tien D. Bui, Ching Y. Suen