Filters








28,585 Hits in 1.8 sec

Willier, Benjamin H., Weiss, Paul A., and Hamburger, Viktor. Analysis of development. Philadelphia: W. B. Saunders Company, 1955. 735 P. $15.00

1955 Science Education  
., Weiss, Paut A., AND HAMBURGER, VIKTOR. Analysis of Develop- ment. Philadelphia: W. B. Saunders Com- pany, 1955. 735 P. $15.00.  ... 
doi:10.1002/sce.3730390369 fatcat:i3fcjqzt2zf23pvkzvjoejwcyq

Günther Grewendorf & Helmut Weiß (eds.). 2014. Bavarian Syntax. Contributions to the Theory of Syntax (Linguistik Aktuell/Linguistics Today 220). Amsterdam: John Benjamins. vi, 339 S

Roland Hinterhölzl
2017 Zeitschrift für Rezensionen zur Germanistischen Sprachwissenschaft  
but behave like regular plural DPs in subject and possibly other argument positions, as is illustrated in (27) On the basis of the interpretational properties of these XPs based on family names (FN), Weiß  ... 
doi:10.1515/zrs-2017-0001 fatcat:rymmyntaerfhtmtaceej5xelya

Odometer Based Systems [article]

Matthew Foreman, Benjamin Weiss
2020 arXiv   pre-print
Construction sequences are a general method of building symbolic shifts that capture cut-and-stack constructions and are general enough to give symbolic representations of Anosov-Katok diffeomorphisms. We show here that any finite entropy system that has an odometer factor can be represented as a special class of construction sequences, the odometer based construction sequences which correspond to those cut-and-stack constructions that do not use spacers. We also show that any additional
more » ... y called the "small word condition" can also be satisfied in a uniform way.
arXiv:2009.10162v1 fatcat:nawyqe3yevgj5oiligrwo656li

Generating Product Systems [article]

Nir Avni, Benjamin Weiss
2009 arXiv   pre-print
Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.
arXiv:0907.1201v1 fatcat:mxlrwvoqejd7rcpufyssjpiel4

Uniformly recurrent subgroups [article]

Eli Glasner, Benjamin Weiss
2014 arXiv   pre-print
Weiss that for an arbitrary countable infinite group G, any free ergodic probability measure preserving G-system admits a minimal model.  ... 
arXiv:1402.5028v1 fatcat:p3bmavca5vcshh3xhwql3zfvee

On classifying processes [article]

Gusztav Morvai, Benjamin Weiss
2007 arXiv   pre-print
See Ornstein and Weiss (1990) for some further results on this kind of question. Our concern in this paper is with the class of finitarily Markovian processes which is defined as follows.  ...  This class includes all finite order Markov chains (mixing or not) and many other processes such as the finitarily deterministic processes of Kalikow, Katznelson and Weiss (1992 P (M i = 0) = P (M i  ... 
arXiv:0710.3775v1 fatcat:si6nvhaqsfb6zdwywgirrat6ni

Inferring the conditional mean [article]

Gusztav Morvai, Benjamin Weiss
2007 arXiv   pre-print
This estimator can be viewed as a sampled version of the predictor in Morvai, Yakowitz and Györfi (1996) , Weiss (2000) , Algoet (1999) and .  ...  Algorithms of this kind were proposed for binary time series in Morvai (2003) and Morvai and Weiss (2003) . We will consider two-sided real-valued processes {X n } ∞ n=−∞ .  ... 
arXiv:0710.3757v1 fatcat:s7iw4occ7bhexhupghffuitm54

Structured Prediction Cascades [article]

David Weiss, Benjamin Sapp, Ben Taskar
2012 arXiv   pre-print
Structured prediction tasks pose a fundamental trade-off between the need for model complexity to increase predictive power and the limited computational resources for inference in the exponentially-sized output spaces such models require. We formulate and develop the Structured Prediction Cascade architecture: a sequence of increasingly complex models that progressively filter the space of possible outputs. The key principle of our approach is that each model in the cascade is optimized to
more » ... rately filter and refine the structured output state space of the next model, speeding up both learning and inference in the next layer of the cascade. We learn cascades by optimizing a novel convex loss function that controls the trade-off between the filtering efficiency and the accuracy of the cascade, and provide generalization bounds for both accuracy and efficiency. We also extend our approach to intractable models using tree-decomposition ensembles, and provide algorithms and theory for this setting. We evaluate our approach on several large-scale problems, achieving state-of-the-art performance in handwriting recognition and human pose recognition. We find that structured prediction cascades allow tremendous speedups and the use of previously intractable features and models in both settings.
arXiv:1208.3279v1 fatcat:ru4l45dvinh3lptf7mvymyxzee

Three Zutot [article]

Eli Glasner, Benjamin Weiss
2012 arXiv   pre-print
We apply the Furstenberg-Weiss construction [5] to the above example, as follows. Start with the profinite system (P, G) which is of course minimal and strictly ergodic.  ...  Now apply (a slight strengthening of 3 ) the Furstenberg-Weiss theorem to obtain a commutative diagram: U φ G G id×π Ũ γ α × × V σ Ṽ β P where, (Ũ, G) and (Ṽ , G) are minimal systems, the homomorphism  ... 
arXiv:1102.5754v2 fatcat:sulks3wt5bcm3lxktkc2v57bva

On Hilbert dynamical systems [article]

Eli Glasner, Benjamin Weiss
2010 arXiv   pre-print
By results of Glasner and Weiss [14] and Akin, Auslander and Berg [1] it follows that if (X, T ) is a metric recurrent-transitive WAP dynamical system, then the system (X, T ) is uniformly rigid, i.e  ... 
arXiv:1005.0230v1 fatcat:ffkesrb26ragjem6pf6hxcymwy

Limitations on intermittent forecasting [article]

Gusztav Morvai, Benjamin Weiss
2007 arXiv   pre-print
(Also see Ryabko [10] , Györfi, Morvai, Yakowitz [5] and Weiss [11] .) Morvai [8] considered the following modification of Problem 1.  ... 
arXiv:0710.3773v1 fatcat:w6mlthrkabd5xa3aaxkua3ct6m

Affinely prime dynamical systems [article]

Hillel Furstenberg, Eli Glasner, Benjamin Weiss
2015 arXiv   pre-print
We study representations of groups by "affine" automorphisms of compact, convex spaces, with special focus on "irreducible" representations: equivalently "minimal" actions. When the group in question is PSL(2,R), we exhibit a one-one correspondence between bounded harmonic functions on the upper half-plane and a certain class of irreducible representations. Our analysis shows that, surprisingly, all these representations are equivalent. In fact we find that all irreducible affine
more » ... of this group are equivalent. The key to this is a property we call "linear Stone-Weierstrass" for group actions on compact spaces, which, if it holds for the "universal strongly proximal space" of the group (to be defined) then the induced action on the space of probability measures on this space is the unique irreducible affine representation of the group.
arXiv:1512.05087v1 fatcat:cjtor6ghwvet7d6sxyju5rvbs4

Estimating the Lengths of Memory Words [article]

Gusztav Morvai, Benjamin Weiss
2008 arXiv   pre-print
Benjamin Weiss is with Hebrew University of Jerusalem, Jerusalem 91904 Israel, e-mail: weiss@math.huji.ac.il.  ...  The following theorem has been proved in Morvai and Weiss [15] (Theorem 6). Here we give a simpler proof of it based on Theorem 3.1. PROOF: We argue by contradiction.  ... 
arXiv:0808.2964v1 fatcat:dexvjcd245el7axhpyzuyl7ph4

On minimal actions of countable groups [article]

Eli Glasner, Benjamin Weiss
2018 arXiv   pre-print
Our purpose here is to review some recent developments in the theory of dynamical systems whose common theme is a link between minimal dynamical systems, certain Ramsey type combinatorial properties, and the Lovasz local lemma (LLL). For a general countable group G the two classes of minimal systems we will deal with are (I) the minimal subsystems of the subgroup system (Sub(G), G), called URS's (uniformly recurrent subgroups), and (II) minimal subshifts; i.e. subsystems of the binary Bernoulli G-shift (0, 1^G, _g_g ∈ G).
arXiv:1801.03308v1 fatcat:ct6mcp472jcbdlfqdxcwgmom4y

Forecasting for stationary binary time series [article]

Gusztav Morvai, Benjamin Weiss
2007 arXiv   pre-print
(See also Weiss [18] .) Cover's second problem was on forward estimation (forecasting).  ...  (Also see Ryabko [16] , Györfi, Morvai, Yakowitz [7] and Weiss [18] .) Bailey used the technique of cutting and stacking developed by Ornstein [14] (see also Shields [17] ).  ... 
arXiv:0710.5144v1 fatcat:kbs5i3ni35hnjacliydah5pdcy
« Previous Showing results 1 — 15 out of 28,585 results