Forbidden History: A propos de la collection « Forbidden Hollywood »
نویسندگان
چکیده
منابع مشابه
The forbidden game. A social history of drugs
BRIAN INGLIS, The forbidden game. A social history of drugs, London, Hodder & Stoughton, 1975, 8vo, pp. 256, illus., £4.95. Involvement with drugs is one of the gravest social problems of today. However, it has been a feature of communities throughout history, and it is not only interesting to examine the drugs taken and the attitudes towards their use in the past, but it is valuable in assessi...
متن کاملForbidden Vertices
In this work, we introduce and study the forbidden-vertices problem. Given a polytope P and a subset X of its vertices, we study the complexity of linear optimization over the subset of vertices of P that are not contained in X . This problem is closely related to finding the k-best basic solutions to a linear problem. We show that the complexity of the problem changes significantly depending o...
متن کاملForbidden Patterns
We consider the problem of indexing a collection of documents (a.k.a. strings) of total length n such that the following kind of queries are supported: given two patterns P and P−, list all nmatch documents containing P but not P−. This is a natural extension of the classic problem of document listing as considered by Muthukrishnan [SODA’02], where only the positive pattern P is given. Our main...
متن کاملForbidden Magnification ?
The twin of this paper, “Forbidden Magnification? I.” [1], presents systematic SOM simulations with the explicit magnification control scheme of Bauer, Der, and Herrmann [2] on data for which the theory does not guarantee success, namely data that are n-D, n > 2 and/or data whose components in the different dimensions are not statistically independent. For the unsupported n = 2 cases that we in...
متن کاملMinimal de Bruijn Sequence in a Language with Forbidden Substrings
Let be the following strategy to construct a walk in a labeled digraph: at each vertex, we follow the unvisited arc of minimum label. In this work we study for which languages, applying the previous strategy over the corresponding de Bruijn graph, we finish with an Eulerian cycle, in order to obtain the minimal de Bruijn sequence of the language.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 1895
سال: 2014
ISSN: 0769-0959,1960-6176
DOI: 10.4000/1895.4932