Results 1 - 10
of
5,755
Special Data Dissemination Standard
"... G-20 a grouping composed of major industrial countries and systemically important developing and emerging market countries GFSR ..."
Abstract
- Add to MetaCart
G-20 a grouping composed of major industrial countries and systemically important developing and emerging market countries GFSR
to the Special Data Dissemination Standard (SDDS)
"... Institutional arrangements for producing ..."
II. Data Dissemination Practices and the Special Data Dissemination Standard......................4
, 2003
"... This Report on the Observance of Standards and Codes on Data Module for Canada was prepared by a staff team of the International Monetary Fund as background documentation for the periodic consultation with the member country. It is based on the information available at the time it was completed on O ..."
Abstract
- Add to MetaCart
This Report on the Observance of Standards and Codes on Data Module for Canada was prepared by a staff team of the International Monetary Fund as background documentation for the periodic consultation with the member country. It is based on the information available at the time it was completed
Institutional Arrangements for Producing Macroeconomic Statistics in Countries Subscribing to the Special Data Dissemination Standard (SDDS)
, 2007
"... 1. The paper presents the results of a survey of the institutional arrangements for producing official macroeconomic statistics. The survey covers 41 countries subscribing to the IMF’s Special Data Dissemination Standard (SDDS)—with well-developed national statistical systems. It demonstrates the pr ..."
Abstract
- Add to MetaCart
1. The paper presents the results of a survey of the institutional arrangements for producing official macroeconomic statistics. The survey covers 41 countries subscribing to the IMF’s Special Data Dissemination Standard (SDDS)—with well-developed national statistical systems. It demonstrates
Using Daily Stock Returns: The Case of Event Studies
- Journal of Financial Economics
, 1985
"... This paper examines properties of daily stock returns and how the particular characteristics of these data affect event study methodologies. Daily data generally present few difficulties for event studies. Standard procedures are typically well-specified even when special daily data characteris-tics ..."
Abstract
-
Cited by 805 (3 self)
- Add to MetaCart
This paper examines properties of daily stock returns and how the particular characteristics of these data affect event study methodologies. Daily data generally present few difficulties for event studies. Standard procedures are typically well-specified even when special daily data characteris
Manifold regularization: A geometric framework for learning from labeled and unlabeled examples
- JOURNAL OF MACHINE LEARNING RESEARCH
, 2006
"... We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised framework that incorporates labeled and unlabeled data in a general-purpose learner. Some transductive graph learning al ..."
Abstract
-
Cited by 578 (16 self)
- Add to MetaCart
algorithms and standard methods including Support Vector Machines and Regularized Least Squares can be obtained as special cases. We utilize properties of Reproducing Kernel Hilbert spaces to prove new Representer theorems that provide theoretical basis for the algorithms. As a result (in contrast to purely
Tor: The secondgeneration onion router,”
- in 13th USENIX Security Symposium. Usenix,
, 2004
"... Abstract We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, an ..."
Abstract
-
Cited by 1229 (33 self)
- Add to MetaCart
, and a practical design for location-hidden services via rendezvous points. Tor works on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability
On the time course of perceptual choice: the leaky competing accumulator model
- PSYCHOLOGICAL REVIEW
, 2001
"... The time course of perceptual choice is discussed in a model based on gradual and stochastic accumulation of information in non-linear decision units with leakage (or decay of activation) and competition through lateral inhibition. In special cases, the model becomes equivalent to a classical diffus ..."
Abstract
-
Cited by 480 (19 self)
- Add to MetaCart
diffusion process, but leakage and mutual inhibition work together to address several challenges to existing diffusion, random-walk, and accumulator models. The model provides a good account of data from choice tasks using both time-controlled (e.g., deadline or response signal) and standard reaction time
Efficient Filtering of XML Documents for Selective Dissemination of Information
, 2000
"... Information Dissemination applications are gaining increasing popularity due to dramatic improvements in communications bandwidth and ubiquity. The sheer volume of data available necessitates the use of selective approaches to dissemination in order to avoid overwhelming users with unnecessaryi ..."
Abstract
-
Cited by 364 (17 self)
- Add to MetaCart
with unnecessaryinformation. Existing mechanisms for selective dissemination typically rely on simple keyword matching or "bag of words" information retrieval techniques. The advent of XML as a standard for information exchangeand the development of query languages for XML data enables the development of more
Accelerated Image Reconstruction using Ordered Subsets of Projection Data
- IEEE TRANS. MED. IMAG
, 1994
"... We define ordered subset processing for standard algorithms (such as Expectation Maximization, EM) for image restoration from projections. Ordered subsets methods group projection data into an ordered sequence of subsets (or blocks). An iteration of ordered subsets EM is defined as a single pass thr ..."
Abstract
-
Cited by 301 (2 self)
- Add to MetaCart
We define ordered subset processing for standard algorithms (such as Expectation Maximization, EM) for image restoration from projections. Ordered subsets methods group projection data into an ordered sequence of subsets (or blocks). An iteration of ordered subsets EM is defined as a single pass
Results 1 - 10
of
5,755