Sciweavers

4744 search results - page 134 / 949
» Connected Computing
Sort
View
ICIAP
1997
ACM
15 years 7 months ago
Dynamic Scale-Space Theories
Image formation of a two-dimensional input image can be quantified by imposing an image induced connection and computing the associated torsion and curvature. The latter aspects of...
Alfons H. Salden
DAGSTUHL
2007
15 years 4 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
WG
2004
Springer
15 years 8 months ago
Planar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map. We show...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...
ICMS
2010
15 years 1 months ago
Traversing Symmetric Polyhedral Fans
We propose an algorithm for computing the facets of a pure connected polyhedral fan up to symmetry. The fan is represented by an oracle. With suitable implementations of the oracle...
Anders Nedergaard Jensen
ICPR
2008
IEEE
15 years 9 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