• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 8,429
Next 10 →

The Tree Property

by James Cummings, Matthew Foreman - Adv. Math
"... . We construct a model in which there are no @n-Aronszajn trees for any finite n 2, starting from a model with infinitely many supercompact cardinals. We also construct a model in which there is no ++ -Aronszajn tree for a strong limit cardinal of cofinality !, starting from a model with a ..."
Abstract - Cited by 18 (4 self) - Add to MetaCart
. We construct a model in which there are no @n-Aronszajn trees for any finite n 2, starting from a model with infinitely many supercompact cardinals. We also construct a model in which there is no ++ -Aronszajn tree for a strong limit cardinal of cofinality !, starting from a model with a

Generation and Synchronous Tree-Adjoining Grammars

by Stuart M. Shieber, Yves Schabes , 1990
"... Tree-adjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations. We dem ..."
Abstract - Cited by 774 (43 self) - Add to MetaCart
Tree-adjoining grammars (TAG) have been proposed as a formalism for generation based on the intuition that the extended domain of syntactic locality that TAGs provide should aid in localizing semantic dependencies as well, in turn serving as an aid to generation from semantic representations. We

Convergent Tree-reweighted Message Passing for Energy Minimization

by Vladimir Kolmogorov - ACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI), 2006. ABSTRACTACCEPTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (PAMI) , 2006
"... Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33]- tree-reweighted max-product message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy ..."
Abstract - Cited by 489 (16 self) - Add to MetaCart
on the energy. However, the algorithm is not guaranteed to increase this bound- it may actually go down. In addition, TRW does not always converge. We develop a modification of this algorithm which we call sequential tree-reweighted message passing. Its main property is that the bound is guaranteed

Determinacy and the tree property

by Matthew Foreman, Menachem Magidor, Ralf-dieter Schindler , 2003
"... The following theorems are shown. (A) If ω2 and ω3 have the tree property and either 2 ℵ0 = ℵ2 or Ω is measurable then Π 1 2 Determinacy holds. (B) If ωn has the tree property for all n < ω, n ≥ 2, and 2 <ℵω = ℵω then Projective Determinacy holds. 1 Introduction. A cardinal δ is said to have t ..."
Abstract - Add to MetaCart
The following theorems are shown. (A) If ω2 and ω3 have the tree property and either 2 ℵ0 = ℵ2 or Ω is measurable then Π 1 2 Determinacy holds. (B) If ωn has the tree property for all n < ω, n ≥ 2, and 2 <ℵω = ℵω then Projective Determinacy holds. 1 Introduction. A cardinal δ is said to have

On patterns of cardinals with the tree property

by Ralf-dieter Schindler, Foreman Have , 2008
"... shown in [2], starting from ω many supercompact cardinals, that consistently the following holds. (⋆) For every n < ω, 2 ℵn = ℵn+2 and ℵn+1 has the tree property. Recall that a cardinal κ is said to have the tree property if there is no Aronszajn κ-tree, i.e. if every tree of height κ all of whos ..."
Abstract - Add to MetaCart
shown in [2], starting from ω many supercompact cardinals, that consistently the following holds. (⋆) For every n < ω, 2 ℵn = ℵn+2 and ℵn+1 has the tree property. Recall that a cardinal κ is said to have the tree property if there is no Aronszajn κ-tree, i.e. if every tree of height κ all

Relations between the statistics of natural images and the response properties of cortical cells

by David J. Field - J. Opt. Soc. Am. A , 1987
"... The relative efficiency of any particular image-coding scheme should be defined only in relation to the class of images that the code is likely to encounter. To understand the representation of images by the mammalian visual system, it might therefore be useful to consider the statistics of images f ..."
Abstract - Cited by 831 (18 self) - Add to MetaCart
from the natural environment (i.e., images with trees, rocks, bushes, etc). In this study, various coding schemes are compared in relation to how they represent the information in such natural images. The coefficients of such codes are represented by arrays of mechanisms that respond to local regions

On-Line Construction of Suffix Trees

by Esko Ukkonen , 1995
"... An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part of the strin ..."
Abstract - Cited by 437 (2 self) - Add to MetaCart
An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It has always the suffix tree for the scanned part

Application of Phylogenetic Networks in Evolutionary Studies

by Daniel H. Huson, David Bryant - SUBMITTED TO MBE 2005 , 2005
"... The evolutionary history of a set of taxa is usually represented by a phylogenetic tree, and this model has greatly facilitated the discussion and testing of hypotheses. However, it is well known that more complex evolutionary scenarios are poorly described by such models. Further, even when evoluti ..."
Abstract - Cited by 887 (15 self) - Add to MetaCart
evolution proceeds in a tree-like manner, analysis of the data may not be best served by using methods that enforce a tree structure, but rather by a richer visualization of the data to evaluate its properties, at least as an essential first step. Thus, phylogenetic networks should be employed when

Regression Shrinkage and Selection Via the Lasso

by Robert Tibshirani - JOURNAL OF THE ROYAL STATISTICAL SOCIETY, SERIES B , 1994
"... We propose a new method for estimation in linear models. The "lasso" minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant. Because of the nature of this constraint it tends to produce some coefficients that are exactl ..."
Abstract - Cited by 4212 (49 self) - Add to MetaCart
that are exactly zero and hence gives interpretable models. Our simulation studies suggest that the lasso enjoys some of the favourable properties of both subset selection and ridge regression. It produces interpretable models like subset selection and exhibits the stability of ridge regression. There is also

SCRIBE: A large-scale and decentralized application-level multicast infrastructure

by Miguel Castro, Peter Druschel, Anne-Marie Kermarrec, Antony Rowstron - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (JSAC , 2002
"... This paper presents Scribe, a scalable application-level multicast infrastructure. Scribe supports large numbers of groups, with a potentially large number of members per group. Scribe is built on top of Pastry, a generic peer-to-peer object location and routing substrate overlayed on the Internet, ..."
Abstract - Cited by 658 (29 self) - Add to MetaCart
, and leverages Pastry's reliability, self-organization, and locality properties. Pastry is used to create and manage groups and to build efficient multicast trees for the dissemination of messages to each group. Scribe provides best-effort reliability guarantees, but we outline how an application can extend
Next 10 →
Results 1 - 10 of 8,429
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University