Sciweavers

29908 search results - page 119 / 5982
» On the Complexity of
Sort
View
IJAR
2007
96views more  IJAR 2007»
13 years 10 months ago
Complexity measurement of fundamental pseudo-independent models
Pseudo-independent (PI) models are a special class of probabilistic domain model (PDM) where a set of marginally independent domain variables shows collective dependency, a specia...
J. Lee, Y. Xiang
DAM
1999
81views more  DAM 1999»
13 years 10 months ago
On the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed in...
Jørgen Bang-Jensen, Gregory Gutin
JSYML
2002
60views more  JSYML 2002»
13 years 10 months ago
Compact Complex Manifolds with The Dop and Other Properties
We point out that a certain complex compact manifold constructed by Lieberman has the dimensional order property, and has U-rank different from Morley rank. We also give a suffici...
Anand Pillay, Thomas Scanlon
MLQ
2007
83views more  MLQ 2007»
13 years 9 months ago
Computing the complexity of the relation of isometry between separable Banach spaces
We compute here the Borel complexity of the relation of isometry between separable Banach spaces, using results of Gao, Kechris [1] and Mayer-Wolf [4]. We show that this relation ...
Julien Melleray
JCO
2010
100views more  JCO 2010»
13 years 8 months ago
A class of error-correcting pooling designs over complexes
Abstract As a generalization of de-disjunct matrices and (w,r;d)-cover-freefamilies, the notion of (s,l)e-disjunct matrices is introduced for error-correcting pooling designs over ...
Tayuan Huang, Kaishun Wang, Chih-wen Weng