Results 1  10
of
24,873
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
An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions
 ACMSIAM SYMPOSIUM ON DISCRETE ALGORITHMS
, 1994
"... Consider a set S of n data points in real ddimensional space, R d , where distances are measured using any Minkowski metric. In nearest neighbor searching we preprocess S into a data structure, so that given any query point q 2 R d , the closest point of S to q can be reported quickly. Given any po ..."
Abstract

Cited by 984 (32 self)
 Add to MetaCart
positive real ffl, a data point p is a (1 + ffl)approximate nearest neighbor of q if its distance from q is within a factor of (1 + ffl) of the distance to the true nearest neighbor. We show that it is possible to preprocess a set of n points in R d in O(dn log n) time and O(dn) space, so that given a
A Data Locality Optimizing Algorithm
, 1991
"... This paper proposes an algorithm that improves the locality of a loop nest by transforming the code via interchange, reversal, skewing and tiling. The loop transformation algorithm is based on two concepts: a mathematical formulation of reuse and locality, and a loop transformation theory that unifi ..."
Abstract

Cited by 804 (16 self)
 Add to MetaCart
, and Givens QR factorization. Performance evaluation indicates that locality optimization is especially crucial for scaling up the performance of parallel code.
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
, 1987
"... In this paper we describe simple identification and signature schemes which enable any user to prove his identity and the authenticity of his messages to any other user without shared or public keys. The schemes are provably secure against any known or chosen message attack ff factoring is difficult ..."
Abstract

Cited by 1028 (1 self)
 Add to MetaCart
is difficult, and typical implementations require only 1% to 4% of the number of modular multiplications required by the RSA scheme. Due to their simplicity, security and speed, these schemes are ideally suited for microprocessorbased devices such as smart cards, personal computers, and remote control system.q.
A method for obtaining digital signatures and publickey cryptosystems.
 Communications of the ACM,
, 1978
"... Abstract An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key. This has two important consequences: 1. Couriers or other secure means are not needed to transmit keys, since a message can be encip ..."
Abstract

Cited by 3894 (24 self)
 Add to MetaCart
to a publicly specified power e, and then taking the remainder when the result is divided by the publicly specified product, n, of two large secret prime numbers p and q. Decryption is similar; only a different, secret, power d is used, where e · d ≡ 1 (mod (p − 1) · (q − 1)). The security
Statistics for Experimenters
, 2005
"... R factor = 0.052; wR factor = 0.114; datatoparameter ratio = 18.4. The title compound, [Zn(C8H10F3O2)2(CH4O)2], is a dimethanol coordinated zinc complex with the acetyl acetonate derivative 1,1,1trifluoro5,5dimethylhexane2,4dionate. The bisdiketonate complex, which is isostructural with its ..."
Abstract

Cited by 675 (1 self)
 Add to MetaCart
R factor = 0.052; wR factor = 0.114; datatoparameter ratio = 18.4. The title compound, [Zn(C8H10F3O2)2(CH4O)2], is a dimethanol coordinated zinc complex with the acetyl acetonate derivative 1,1,1trifluoro5,5dimethylhexane2,4dionate. The bisdiketonate complex, which is isostructural with its
The Dantzig selector: statistical estimation when p is much larger than n
, 2005
"... In many important statistical applications, the number of variables or parameters p is much larger than the number of observations n. Suppose then that we have observations y = Ax + z, where x ∈ R p is a parameter vector of interest, A is a data matrix with possibly far fewer rows than columns, n ≪ ..."
Abstract

Cited by 879 (14 self)
 Add to MetaCart
≪ p, and the zi’s are i.i.d. N(0, σ 2). Is it possible to estimate x reliably based on the noisy data y? To estimate x, we introduce a new estimator—we call the Dantzig selector—which is solution to the ℓ1regularization problem min ˜x∈R p ‖˜x‖ℓ1 subject to ‖A T r‖ℓ ∞ ≤ (1 + t −1) √ 2 log p · σ
Ricci Flow with Surgery on ThreeManifolds
"... This is a technical paper, which is a continuation of [I]. Here we verify most of the assertions, made in [I, §13]; the exceptions are (1) the statement that a 3manifold which collapses with local lower bound for sectional curvature is a graph manifold this is deferred to a separate paper, as the ..."
Abstract

Cited by 448 (2 self)
 Add to MetaCart
of all points (x ′ , t ′ ) with x ′ ∈ B(x, t, r) and t ′ ∈ [t, t + △t] or t ′ ∈ [t + △t, t], depending on the sign of △t. A ball B(x, t, ǫ −1 r) is called an ǫneck, if, after scaling the metric with factor r −2, it is ǫclose to the standard neck S 2 × I, with the product metric, where S 2 has
Explaining Collaborative Filtering Recommendations
, 2000
"... $XWRPDWHG FROODERUDWLYH ILOWHULQJ #$&)# V\VWHPV SUHGLFW D SHUVRQV DIILQLW\ IRU LWHPV RU LQIRUPDWLRQ E\ FRQQHFWLQJ WKDW SHUVRQV UHFRUGHG LQWHUHVWV ZLWK WKH UHFRUGHG LQWHUHVWV RI D FRPPXQLW\ RI SHRSOH DQG VKDULQJ UDWLQJV EHWZHHQ OLNH# PLQGHG SHUVRQV# +RZHYHU# FXUUHQW UHFRPPHQGHU V\VWHPV DUH EODFN ..."
Abstract

Cited by 410 (17 self)
 Add to MetaCart
ER[HV# SURYLGLQJ QR WUDQVSDUHQF\ LQWR WKH ZRUNLQJ RI WKH UHFRPPHQGDWLRQ# ([SODQDWLRQV SURYLGH WKDW WUDQVSDUHQF\# H[SRVLQJ WKH UHDVRQLQJ DQG GDWD EHKLQG D UHFRPPHQGDWLRQ# ,Q WKLV SDSHU# ZH DGGUHVV H[SODQDWLRQ LQWHUIDFHV IRU $&) V\VWHPV KRZ#WKH\#VKRXOG#EH#LPSOHPHQWHG#DQG#ZK\#WKH\# VKRXOG
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
are highly crosscorrelated, and principal components analysis implies that they are mostly driven by a single common factor. An important implication of this finding is that if any explanatory variables have been omitted, they are likely not firmspecific. We therefore rerun the regression, but 1 this time
Results 1  10
of
24,873