Sciweavers

896 search results - page 29 / 180
» On completeness of word reversing
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
13 years 7 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
MICCAI
2010
Springer
13 years 5 months ago
Probabilistic Anatomical Connectivity Using Completion Fields
Abstract. Diffusion magnetic resonance imaging has led to active research in the analysis of anatomical connectivity in the brain. Many approaches have been proposed to model the ...
Parya MomayyezSiahkal, Kaleem Siddiqi
EJC
2008
13 years 7 months ago
The distinguishing number of Cartesian products of complete graphs
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...
Wilfried Imrich, Janja Jerebic, Sandi Klavzar
ECCV
2010
Springer
13 years 11 months ago
Efficient Highly Over-Complete Sparse Coding using a Mixture Model
Sparse coding of sensory data has recently attracted notable attention in research of learning useful features from the unlabeled data. Empirical studies show that mapping the data...
CORR
1999
Springer
65views Education» more  CORR 1999»
13 years 7 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe