Results 1  10
of
6,224
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
to be factored, n = deg(f) is the degree of f, and for a polynomial ~ a ~ i with real coefficients a i. i An outline of the algorithm is as follows. First we find, for a suitable small prime number p, a padic irreducible factor h of f, to a certain precision. This is done with Berlekamp's algorithm
Learning and development in neural networks: The importance of starting small
 Cognition
, 1993
"... It is a striking fact that in humans the greatest learnmg occurs precisely at that point in time childhood when the most dramatic maturational changes also occur. This report describes possible synergistic interactions between maturational change and the ability to learn a complex domain (language ..."
Abstract

Cited by 531 (17 self)
 Add to MetaCart
It is a striking fact that in humans the greatest learnmg occurs precisely at that point in time childhood when the most dramatic maturational changes also occur. This report describes possible synergistic interactions between maturational change and the ability to learn a complex domain
Search and replication in unstructured peertopeer networks
, 2002
"... Abstract Decentralized and unstructured peertopeer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the floodingbased query algorithm used in Gnutella does n ..."
Abstract

Cited by 692 (6 self)
 Add to MetaCart
Abstract Decentralized and unstructured peertopeer networks such as Gnutella are attractive for certain applicationsbecause they require no centralized directories and no precise control over network topologies and data placement. However, the floodingbased query algorithm used in Gnutella does
Anti de Sitter space and holography
, 1998
"... Recently, it has been proposed by Maldacena that large N limits of certain conformal field theories in d dimensions can be described in terms of supergravity (and string theory) on the product of d+1dimensional AdS space with a compact manifold. Here we elaborate on this idea and propose a precise ..."
Abstract

Cited by 383 (7 self)
 Add to MetaCart
Recently, it has been proposed by Maldacena that large N limits of certain conformal field theories in d dimensions can be described in terms of supergravity (and string theory) on the product of d+1dimensional AdS space with a compact manifold. Here we elaborate on this idea and propose a precise
Reflective and impulsive determinants of social behavior
 Personality and Social Psychology Review
, 2004
"... This article describes a 2systems model that explains social behavior as a joint function of reflective and impulsive processes. In particular, it is assumed that social behavior is controlled by 2 interacting systems that follow different operating principles. The reflective system generates behav ..."
Abstract

Cited by 365 (5 self)
 Add to MetaCart
in a synergistic or antagonistic fashion. It extends previous models by integrating motivational components that allow more precise predictions of behavior. The implications of this reflectiveâ€“impulsive model are applied to various phenomena from social psychology and beyond. Extending previous dual
Compressed sensing and best kterm approximation
 J. Amer. Math. Soc
, 2009
"... Compressed sensing is a new concept in signal processing where one seeks to minimize the number of measurements to be taken from signals while still retaining the information necessary to approximate them well. The ideas have their origins in certain abstract results from functional analysis and app ..."
Abstract

Cited by 282 (10 self)
 Add to MetaCart
Compressed sensing is a new concept in signal processing where one seeks to minimize the number of measurements to be taken from signals while still retaining the information necessary to approximate them well. The ideas have their origins in certain abstract results from functional analysis
Four Dark Corners of Requirements Engineering
 ACM Transactions on Software Engineering and Methodology
, 1997
"... This article shines some light in the "four dark corners," exposing problems and proposing solutions. We show that all descriptions involved in requirements engineering should be descriptions of the environment. We show that certain control information is necessary for sound requirements e ..."
Abstract

Cited by 255 (9 self)
 Add to MetaCart
This article shines some light in the "four dark corners," exposing problems and proposing solutions. We show that all descriptions involved in requirements engineering should be descriptions of the environment. We show that certain control information is necessary for sound requirements
Full Abstraction for PCF
 INFORMATION AND COMPUTATION
, 1996
"... An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "historyfree" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable i ..."
Abstract

Cited by 254 (16 self)
 Add to MetaCart
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "historyfree" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable
Generalization Of An Inequality By Talagrand, And Links With The Logarithmic Sobolev Inequality
 J. Funct. Anal
, 2000
"... . We show that transport inequalities, similar to the one derived by Talagrand [30] for the Gaussian measure, are implied by logarithmic Sobolev inequalities. Conversely, Talagrand's inequality implies a logarithmic Sobolev inequality if the density of the measure is approximately logconcave, ..."
Abstract

Cited by 244 (12 self)
 Add to MetaCart
concave, in a precise sense. All constants are independent of the dimension, and optimal in certain cases. The proofs are based on partial dierential equations, and an interpolation inequality involving the Wasserstein distance, the entropy functional and the Fisher information. Contents 1. Introduction 1 2
The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms
 Russian Math. Surveys
, 1970
"... In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding). This defini ..."
Abstract

Cited by 235 (1 self)
 Add to MetaCart
In 1964 Kolmogorov introduced the concept of the complexity of a finite object (for instance, the words in a certain alphabet). He defined complexity as the minimum number of binary signs containing all the information about a given object that are sufficient for its recovery (decoding
Results 1  10
of
6,224