Results 1 - 10
of
5,085
Monte Carlo Statistical Methods
, 1998
"... This paper is also the originator of the Markov Chain Monte Carlo methods developed in the following chapters. The potential of these two simultaneous innovations has been discovered much latter by statisticians (Hastings 1970; Geman and Geman 1984) than by of physicists (see also Kirkpatrick et al. ..."
Abstract
-
Cited by 1498 (30 self)
- Add to MetaCart
This paper is also the originator of the Markov Chain Monte Carlo methods developed in the following chapters. The potential of these two simultaneous innovations has been discovered much latter by statisticians (Hastings 1970; Geman and Geman 1984) than by of physicists (see also Kirkpatrick et al
Fully homomorphic encryption using ideal lattices
- In Proc. STOC
, 2009
"... We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in three steps. First, we provide a general result – that, to construct an encryption scheme that permits evaluation of arbitra ..."
Abstract
-
Cited by 663 (17 self)
- Add to MetaCart
that is represented as a lattice), as needed to evaluate general circuits. Unfortunately, our initial scheme is not quite bootstrappable – i.e., the depth that the scheme can correctly evaluate can be logarithmic in the lattice dimension, just like the depth of the decryption circuit, but the latter is greater than
A Survey on Transfer Learning
"... A major assumption in many machine learning and data mining algorithms is that the training and future data must be in the same feature space and have the same distribution. However, in many real-world applications, this assumption may not hold. For example, we sometimes have a classification task i ..."
Abstract
-
Cited by 459 (24 self)
- Add to MetaCart
in one domain of interest, but we only have sufficient training data in another domain of interest, where the latter data may be in a different feature space or follow a different data distribution. In such cases, knowledge transfer, if done successfully, would greatly improve the performance of learning
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract
-
Cited by 340 (44 self)
- Add to MetaCart
for this logic programming language must address the problem of splitting contexts; that is, when attempting to prove a multiplicative conjunction (tensor), say G1 ⊗ G2, fromthe context ∆, the latter must be split into disjoint contexts ∆1 and ∆2 for which G1 follows from ∆1 and G2 follows from ∆2. Since
Estimating the value of political connections
- American Economic Review
"... As the Indonesian economy went into a downward spiral in the latter half of 1997, there was much speculation and debate as to the reasons behind the sudden decline. Most explanations gave at least some role to investor panic, which had led to a massive outflow of foreign capital. At the root of this ..."
Abstract
-
Cited by 297 (5 self)
- Add to MetaCart
As the Indonesian economy went into a downward spiral in the latter half of 1997, there was much speculation and debate as to the reasons behind the sudden decline. Most explanations gave at least some role to investor panic, which had led to a massive outflow of foreign capital. At the root
Phase retrieval algorithms: a comparison
- Appl. Opt
, 1982
"... Iterative algorithms for phase retrieval from intensity data are compared to gradient search methods. Both the problem of phase retrieval from two intensity measurements (in electron microscopy or wave front sens-ing) and the problem of phase retrieval from a single intensity measurement plus a non- ..."
Abstract
-
Cited by 294 (15 self)
- Add to MetaCart
-negativity constraint (in astronomy) are considered, with emphasis on the latter. It is shown that both the error-reduction algo-rithm for the problem of a single intensity measurement and the Gerchberg-Saxton algorithm for the prob-lem of two intensity measurements converge. The error-reduction algorithm is also shown
Lasso-type recovery of sparse representations for high-dimensional data
- ANNALS OF STATISTICS
, 2009
"... The Lasso is an attractive technique for regularization and variable selection for high-dimensional data, where the number of predictor variables pn is potentially much larger than the number of samples n. However, it was recently discovered that the sparsity pattern of the Lasso estimator can only ..."
Abstract
-
Cited by 250 (14 self)
- Add to MetaCart
The Lasso is an attractive technique for regularization and variable selection for high-dimensional data, where the number of predictor variables pn is potentially much larger than the number of samples n. However, it was recently discovered that the sparsity pattern of the Lasso estimator can only
Dynamic storage allocation: A survey and critical review
, 1995
"... Dynamic memory allocation has been a fundamental part of most computer systems since roughly 1960, and memory allocation is widely considered to be either a solved problem or an insoluble one. In this survey, we describe a variety of memory allocator designs and point out issues relevant to their de ..."
Abstract
-
Cited by 241 (6 self)
- Add to MetaCart
policy, while the latter is more important; higher-level strategic issues are still more important, but have not been given much attention. Most theoretical analyses and empirical allocator evaluations to date have relied on very strong assumptions of randomness and independence, but real program
A Nonlinear Primal-Dual Method For Total Variation-Based Image Restoration
, 1995
"... . We present a new method for solving total variation (TV) minimization problems in image restoration. The main idea is to remove some of the singularity caused by the non-differentiability of the quantity jruj in the definition of the TV-norm before we apply a linearization technique such as Newton ..."
Abstract
-
Cited by 232 (22 self)
- Add to MetaCart
norms. Experimental results show that the new method has much improved global convergence behaviour than the primal Newton's method. 1. Introduction. During some phases of the manipulation of an image some random noise and blurring is usually introduced. The presence of this noise and blurring
INTERCONFESSIONAL DIALOGUE AND ECUMENICAL MOVEMENT IN THE LATTER
"... Abstract. The new Europe will bring together a plurality of religions, traditions and cultures. The process of European integration has not only political implications, but also economic, political, social and religious implications. In this context, the building of a New Europe requires a coherent ..."
Abstract
- Add to MetaCart
in Europe was made by the cooperation between CEC and CCEE to organize the European Ecumenical Assemblies and to elaborate the document entitled Charta Oecumenica. The ecumenical dialogue is practically based on the phenomenon of the concentric circles. What is important is in fact how much the parts have
Results 1 - 10
of
5,085