Sciweavers

13621 search results - page 95 / 2725
» Computability and Complexity in Self-assembly
Sort
View
ICPP
1994
IEEE
14 years 2 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
APAL
2010
125views more  APAL 2010»
13 years 10 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
CVPR
2001
IEEE
15 years 2 days ago
Text Identification in Complex Background Using SVM
Datong Chen, Hervé Bourlard, Jean-Philippe ...
ICPR
2002
IEEE
14 years 11 months ago
Text Segmentation and Recognition in Complex Background Based on Markov Random Field
Datong Chen, Jean-Marc Odobez, Hervé Bourla...