CĂRȚI ÎN ENGLEZĂ ÎN LEGĂTURĂ CU «LABELLABLE»
Descoperă întrebuințarea
labellable în următoarea selecție bibliografică. Cărți în legătură cu
labellable și extrase din aceasta pentru a furniza contextul de întrebuințare al acestuia în literatura Engleză.
1
Buildings and Classical Groups
We say that a chamber complex is uniquely labellable if, given labellings AI : X ->
/i and A2 : X -t I? where Ii,h are simplices, there is a set isomorphism / : /2 -> A so
that Aa = / ° AI , where we also write / for the induced map on subsets of /2 .
2
Words, Lexemes, Concepts, Approaches to the Lexicon: Studies ...
It must be labellable, so to speak. To find out what this means, it may be useful to
look at the 'labellability' of concrete things first. For real objects to be labellable,
they must be concrete (you cannot attach a lable to ideas); they must be solid, ...
Wolfgang Falkner, Hans-Jörg Schmid, 1999
3
26th Annual Symposium on Foundations of Computer Science: ...
Images that have a legal labelling are called labellable. Proposition 1 (Huffman [
2~]). If an image is realizable then it is labellable. Telling whether an image is
labellable is another well-looked at computational problem, a first step towards ...
4
Identifiability of State Space Models: With Applications to ...
(1.6) Now consider the subsystem constituted by the set of all labellable atoms.
Two atoms will belong to the same equivalence class if they have the same
functional behavior, that is to say if they belong to the same chemical species and
are ...
5
Network: Computation in Neural Systems
The tests of this stage included physically possible and labellable single objects
of different complexities (objects (a) and (b) of figure 4), impossible but still
labellable single objects (figure 4(c)), impossible and non-labellable single
objects ...
6
Advances in Multiresolution for Geometric Modelling
It seems that new work in this direction would be valuable, but it is now clear that
the ambition of having all edges separately labellable is not in fact necessary to
cover the regular non-uniform case. It is also clear that the rules for defining the ...
Neil Dodgson, Michael S. Floater, Malcolm Sabin, 2006
7
Intelligent Computer Mathematics: 9th International ...
... if in(v) = 〈a1 ,...,a n〉 and out(v) = 〈b1 ,...,b m〉 then θv : 〈θa1,...,θan〉 → 〈θb1 ,...,
θbm〉 We say a concrete graph Γ is T,F-labellable if there exists an T,F-labelling
for it; and if θ is a labelling for Γ, then the pair (Γ,θ) is called a T,F-labelled graph.
8
Advances in Artificial Life: 7th European Conference, ECAL ...
... universes and although it is tempting to ask that growing up should involve an
increasing competence in skills that are concisely labellable and humanly
meaningful, this is perhaps asking too much. We feel that at least the levels in a ...
9
Origin and Evolution of the Universe: Evidence for Design?
... of consciousness that may escape this translation into the verbal is the
immediate awareness of sensation or feelings, such as heat, pain, redness,
music, and the like, which occupy one's thoughts at the moment without being
labellable.
John M. Robson, Canadian Institute for Advanced Research, 1987
10
On the Combinatorial and Spectral Properties of Finite ...
Viewing P as a graph, to say that P is an n-dimensional incidence geometry is the
same as saying that the vertices of P are labellable by n colors so that no two
adjacent vertices are of the same color. For example the partially ordered set of ...
