نتایج جستجو برای: consecutive separating

تعداد نتایج: 119701  

2007
Marina Costa

Objectives: To evaluate the usefulness of diverse combinations of pleural cholesterol concentration, pleural or serum protein, and lactate dehydrogenase (LDH) levels for the differentiation ofpleural exudates and transudates. Design: Prospective laboratory study of pleural effu¬ sions. Setting: Medical school hospital. Patients: One hundred eighty consecutive internal medicine ward patients in ...

2014
Stefan M. Kallenberger Constanze Schmidt Peter Dechent Clemens Forster Nicole von Steinbüchel Torsten Wüstenberg Hans Strasburger

Visual fusion is the process in which differing but compatible binocular information is transformed into a unified percept. Even though this is at the basis of binocular vision, the underlying neural processes are, as yet, poorly understood. In our study we therefore aimed to investigate neural correlates of visual fusion. To this end, we presented binocularly compatible, fusible (BF), and inco...

1996
Joshua B. Tenenbaum William T. Freeman

In many vision problems, we want to infer two (or more) hidden factors which interact to produce our observations. We may want to disentangle illuminant and object colors in color constancy; rendering conditions from surface shape in shape-from-shading; face identity and head pose in face recognition; or font and letter class in character recognition. We refer to these two factors generically a...

2001
Gérard D. Cohen Sylvia B. Encheva Hans Georg Schaathun

Let Γ be a code of length n, and (T,U ) a pair of disjoint subsets of Γ. We say that (T,U ) is separated if there exists a coordinate i, such that for any codeword (c1, . . . , cn) ∈ T and any codeword (c ′ 1, . . . , c ′ n) ∈ U , ci 6= c ′ i. The code Γ is (t,u)-separating if all pairs (T,U ) with #T = t and #U = u are separated. Separating codes (or systems) are known from combinatorics, and ...

1999
A David Redish David S Touretzky

The place elds of hippocampal cells in old animals sometimes change when an animal is removed from and then returned to an environment Barnes et al The ensemble correlation between two sequential visits to the same environment shows a strong bimodality for old animals near indicative of remapping and greater than indicative of a similar representation between experiences but a strong unimodalit...

2005
Jan Draisma Gregor Kemper David Wehlau J. Draisma G. Kemper D. Wehlau

We prove a characteristic free version of Weyl’s theorem on polarization. Our result is an exact analogue of Weyl’s theorem, the difference being that our statement is about separating invariants rather than generating invariants. For the special case of finite group actions we introduce the concept of cheap polarization, and show that it is enough to take cheap polarizations of invariants of j...

Journal: :Genome informatics. International Conference on Genome Informatics 2001
G Myers

We consider the problem of separating two distinct classes of k similar sequences of length n over an alphabet of size s that have been optimally multi-aligned. An objective function based on minimizing the consensus score of the separated halves is introduced and we present an O(k3n) heuristic algorithm and two optimal branch-and-bound algorithms for the problem. The branch-and-bound algorithm...

1997
Helmut Lescow

For a Muller automaton only a subset of its states is needed to decide whether a run is accepting or not: The set I the innnitely often visited states can be replaced by the intersection I \ W with a xed set W of states, provided W is large enough to distinguish between accepting and non-accepting loops in the automaton. We call such a subset W a separating set. Whereas the idea was previously ...

2010
Vincent Laviron Bor-Yuh Evan Chang Xavier Rival

Detailed memory models that expose individual fields are necessary to precisely analyze code that makes use of low-level aspects such as, pointers to fields and untagged unions. Yet, higher-level representations that collect fields into records are often used because they are typically more convenient and efficient in modeling the program heap. In this paper, we present a shape graph representa...

2005
Christine Bessenrodt Gunter Malle Jørn B. Olsson

We investigate the problem of finding a set of prime divisors of the order of a finite group, such that no two irreducible characters are in the same p-block for all primes p in the set. Our main focus is on the simple and quasisimple groups. For results on the alternating and symmetric groups and their double covers, some combinatorial results on the cores of partitions are proved, which may b...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید