Results 1  10
of
6,751
Inducing Features of Random Fields
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1997
"... We present a technique for constructing random fields from a set of training samples. The learning paradigm builds increasingly complex fields by allowing potential functions, or features, that are supported by increasingly large subgraphs. Each feature has a weight that is trained by minimizing the ..."
Abstract

Cited by 670 (10 self)
 Add to MetaCart
introduced in this paper differ from those common to much of the computer vision literature in that the underlying random fields are nonMarkovian and have a large number of parameters that must be estimated. Relations to other learning approaches, including decision trees, are given. As a demonstration
Data cube: A relational aggregation operator generalizing groupby, crosstab, and subtotals
, 1996
"... Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zerodimensional or onedimensional aggregates. Applications need the Ndimensional generalization of these op ..."
Abstract

Cited by 860 (11 self)
 Add to MetaCart
of these operators. This paper defines that operator, called the data cube or simply cube. The cube operator generalizes the histogram, crosstabulation, rollup, drilldown, and subtotal constructs found in most report writers. The novelty is that cubes are relations. Consequently, the cube operator can be imbedded
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
, and Southern Methodist University. The relation between stock and bond returns has been widely studied at the aggregate level (see, for example, Campbell and Ammer (1993), Keim and Stambaugh (1986), Fama and French (1989), and Fama and French (1993)). Recently, a few studies have investigated that relation
Relational Classifiers in a Nonrelational world: Using Homophily to Create Relations
"... Abstractâ€”Research in the past decade on statistical relational learning (SRL) has shown the power of the underlying network of relations in relational data. Even models built using only relations often perform comparably to models built using sophisticated relational learning methods. However, many ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
relations such that relational inference results in better classification performance than nonrelational inference. Using simple similaritybased rules to create relations and weighting the strength of these relations using homophily on instance labels, we test whether relational inference techniques
Essentially nonoscillatory and weighted essentially nonoscillatory schemes for hyperbolic conservation laws
, 1998
"... In these lecture notes we describe the construction, analysis, and application of ENO (Essentially NonOscillatory) and WENO (Weighted Essentially NonOscillatory) schemes for hyperbolic conservation laws and related HamiltonJacobi equations. ENO and WENO schemes are high order accurate nite di ere ..."
Abstract

Cited by 270 (26 self)
 Add to MetaCart
In these lecture notes we describe the construction, analysis, and application of ENO (Essentially NonOscillatory) and WENO (Weighted Essentially NonOscillatory) schemes for hyperbolic conservation laws and related HamiltonJacobi equations. ENO and WENO schemes are high order accurate nite di
Weaknesses in the Key Scheduling Algorithm of RC4
 PROCEEDINGS OF THE 4TH ANNUAL WORKSHOP ON SELECTED AREAS OF CRYPTOGRAPHY
, 2001
"... In this paper we present several weaknesses in the key scheduling algorithm of RC4, and describe their cryptanalytic significance. We identify a large number of weak keys, in which knowledge of a small number of key bits suffices to determine many state and output bits with nonnegligible probabilit ..."
Abstract

Cited by 270 (1 self)
 Add to MetaCart
negligible probability. We use these weak keys to construct new distinguishers for RC4, and to mount related key attacks with practical complexities. Finally, we show that RC4 is completely insecure in a common mode of operation which is used in the widely deployed Wired Equivalent Privacy protocol (WEP, which is part
Compiling Mappings to Bridge Applications and Databases
 ACM Trans. Database Syst. 33(4), Article
"... Translating data and data access operations between applications and databases is a longstanding data management problem. We present a novel approach to this problem, in which the relationship between the application data and the persistent storage is specified using a declarative mapping, which is ..."
Abstract

Cited by 45 (3 self)
 Add to MetaCart
constraints and supporting nonrelational constructs. Categories and Subject Descriptors:
Discreteness of area and volume in quantum gravity
, 2008
"... We study the operator that corresponds to the measurement of volume, in nonperturbative quantum gravity, and we compute its spectrum. The operator is constructed in the loop representation, via a regularization procedure; it is finite, background independent, and diffeomorphisminvariant, and there ..."
Abstract

Cited by 242 (35 self)
 Add to MetaCart
We study the operator that corresponds to the measurement of volume, in nonperturbative quantum gravity, and we compute its spectrum. The operator is constructed in the loop representation, via a regularization procedure; it is finite, background independent, and diffeomorphism
MBT: A MemoryBased Part of Speech TaggerGenerator
 PROC. OF FOURTH WORKSHOP ON VERY LARGE CORPORA
, 1996
"... We introduce a memorybased approach to part of speech tagging. Memorybased learning is a form of supervised learning based on similaritybased reasoning. The part of speech tag of a word in a particular context is extrapolated from the most similar cases held in memory. Supervised learning approac ..."
Abstract

Cited by 236 (56 self)
 Add to MetaCart
approaches are useful when a tagged corpus is available as an example of the desired output of the tagger. Based on such a corpus, the taggergenerator automatically builds a tagger which is able to tag new text the same way, diminishing development time for the construction of a tagger considerably. Memory
Fast Marching Methods
 SIAM Review
, 1998
"... Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms. They are opti ..."
Abstract

Cited by 215 (5 self)
 Add to MetaCart
Fast Marching Methods are numerical schemes for computing solutions to the nonlinear Eikonal equation and related static HamiltonJacobi equations. Based on entropysatisfying upwind schemes and fast sorting techniques, they yield consistent, accurate, and highly efficient algorithms
Results 1  10
of
6,751