Results 1  10
of
4,702
OPTICS: Ordering Points To Identify the Clustering Structure
, 1999
"... Cluster analysis is a primary method for database mining. It is either used as a standalone tool to get insight into the distribution of a data set, e.g. to focus further analysis and data processing, or as a preprocessing step for other algorithms operating on the detected clusters. Almost all of ..."
Abstract

Cited by 527 (51 self)
 Add to MetaCart
of the wellknown clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, for many realdata sets there does not even exist a global parameter setting for which the result of the clustering algorithm describes
Tobins Q, corporate diversification and firm performance
, 1993
"... In this paper, we show that Tobin's q and firm diversification are negatively related. This negative relation holds for different diversification measures and when we control for other known determinants of q. We show further that diversified firms have lower q's than equivalent portfolios ..."
Abstract

Cited by 499 (26 self)
 Add to MetaCart
In this paper, we show that Tobin's q and firm diversification are negatively related. This negative relation holds for different diversification measures and when we control for other known determinants of q. We show further that diversified firms have lower q's than equivalent
Factoring polynomials with rational coefficients
 MATH. ANN
, 1982
"... In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomia ..."
Abstract

Cited by 961 (11 self)
 Add to MetaCart
In this paper we present a polynomialtime algorithm to solve the following problem: given a nonzero polynomial fe Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive
Loopy belief propagation for approximate inference: An empirical study. In:
 Proceedings of Uncertainty in AI,
, 1999
"... Abstract Recently, researchers have demonstrated that "loopy belief propagation" the use of Pearl's polytree algorithm in a Bayesian network with loops can perform well in the context of errorcorrecting codes. The most dramatic instance of this is the near Shannonlimit performanc ..."
Abstract

Cited by 676 (15 self)
 Add to MetaCart
. Introduction The task of calculating posterior marginals on nodes in an arbitrary Bayesian network is known to be NP hard In this paper we investigate the approximation performance of "loopy belief propagation". This refers to using the wellknown Pearl polytree algorithm [12] on a Bayesian network
A Query Language and Optimization Techniques for Unstructured Data
, 1996
"... A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in treelike structures whose components can be used ..."
Abstract

Cited by 407 (35 self)
 Add to MetaCart
equally well to represent sets and tuples. Such structures allow great flexibility in data representation What query language is appropriate for such structures? Here we propose a simple language UnQL for querying data organized as a rooted, edgelabeled graph. In this model, relational data may
Regularization Theory and Neural Networks Architectures
 Neural Computation
, 1995
"... We had previously shown that regularization principles lead to approximation schemes which are equivalent to networks with one layer of hidden units, called Regularization Networks. In particular, standard smoothness functionals lead to a subclass of regularization networks, the well known Radial Ba ..."
Abstract

Cited by 395 (32 self)
 Add to MetaCart
We had previously shown that regularization principles lead to approximation schemes which are equivalent to networks with one layer of hidden units, called Regularization Networks. In particular, standard smoothness functionals lead to a subclass of regularization networks, the well known Radial
The McKay correspondence as an equivalence of derived categories
 J. AMER. MATH. SOC
, 2001
"... The classical McKay correspondence relates representations of a finite subgroup G SL(2;C) to the cohomology of the wellknown minimal resolution of the Kleinian singularity C2=G. GonzalezSprinberg and Verdier [10] interpreted the McKay correspondence as an isomorphism on K theory, observing that t ..."
Abstract

Cited by 235 (7 self)
 Add to MetaCart
The classical McKay correspondence relates representations of a finite subgroup G SL(2;C) to the cohomology of the wellknown minimal resolution of the Kleinian singularity C2=G. GonzalezSprinberg and Verdier [10] interpreted the McKay correspondence as an isomorphism on K theory, observing
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
 PROCEEDINGS OF THE TWENTYFIRST ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1989
"... In this paper we prove the intractability of learning several classes of Boolean functions in the distributionfree model (also called the Probably Approximately Correct or PAC model) of learning from examples. These results are representation independent, in that they hold regardless of the syntact ..."
Abstract

Cited by 347 (14 self)
 Add to MetaCart
of the syntactic form in which the learner chooses to represent its hypotheses. Our methods reduce the problems of cracking a number of wellknown publickey cryptosystems to the learning problems. We prove that a polynomialtime learning algorithm for Boolean formulae, deterministic finite automata or constant
MOMENT PREFERENCES AND POLYNOMIAL UTILITY *
, 1987
"... This paper presents a direct algebraic (i.e., noncalculus) proof of the wellknown equivalence of mmoment preferences and mdegree polynomial utility for an expected utility maximizer. 1. ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This paper presents a direct algebraic (i.e., noncalculus) proof of the wellknown equivalence of mmoment preferences and mdegree polynomial utility for an expected utility maximizer. 1.
A comparison of wellknown ordinal notation systems for ε0
 ANNALS OF PURE AND APPLIED LOGIC 147 (2007) 48–70
, 2007
"... We consider five ordinal notation systems of ε0 which are all wellknown and of interest in prooftheoretic analysis of Peano arithmetic: Cantor’s system, systems based on binary trees and on countable treeordinals, and the systems due to Schütte and Simpson, and to Beklemishev. The main point of ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider five ordinal notation systems of ε0 which are all wellknown and of interest in prooftheoretic analysis of Peano arithmetic: Cantor’s system, systems based on binary trees and on countable treeordinals, and the systems due to Schütte and Simpson, and to Beklemishev. The main point
Results 1  10
of
4,702