Results 1  10
of
4,313,772
Getting more from outofcore columnsort
 In 4th Workshop on Algorithm Engineering and Experiments (ALENEX 02
, 2002
"... Abstract. We describe two improvements to a previous implementation of outofcore columnsort, in which data reside on multiple disks. The first improvement replaces asynchronous I/O and communication calls by synchronous calls within a threaded framework. Experimental runs show that this improvemen ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
Abstract. We describe two improvements to a previous implementation of outofcore columnsort, in which data reside on multiple disks. The first improvement replaces asynchronous I/O and communication calls by synchronous calls within a threaded framework. Experimental runs show
Columnsort Lives! An Efficient OutofCore Sorting Program
 IN PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM SYMPOSIUM ON PARALLEL ALGORITHMS AND ARCHITECTURES
, 2001
"... We present the design and implementation of a parallel outofcore sorting algorithm, which is based on Leighton's columnsort algorithm. We show how to relax some of the steps of the original columnsort algorithm to permit a faster outofcore implementation. Our algorithm requires only 4 passe ..."
Abstract

Cited by 22 (7 self)
 Add to MetaCart
We present the design and implementation of a parallel outofcore sorting algorithm, which is based on Leighton's columnsort algorithm. We show how to relax some of the steps of the original columnsort algorithm to permit a faster outofcore implementation. Our algorithm requires only 4
Relaxing the problemsize bound for outofcore columnsort
 In Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures
, 2003
"... Previous implementations of outofcore columnsort limit the problem size to N ≤ � (M/P) 3 /2, where N is the number of records to sort, P is the number of processors, and M is the total number of records that the entire system can hold in its memory (so that M/P is the number of records that a sin ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Previous implementations of outofcore columnsort limit the problem size to N ≤ � (M/P) 3 /2, where N is the number of records to sort, P is the number of processors, and M is the total number of records that the entire system can hold in its memory (so that M/P is the number of records that a
Slabpose columnsort: A new oblivious algorithm for outofcore sorting on distributedmemory clusters
, 2004
"... Our goal is to develop a robust outofcore sorting program for a distributedmemory cluster. The literature contains two dominant paradigms for outofcore sorting algorithms: mergingbased and partitioningbased. We explore a third paradigm, that of oblivious algorithms. Unlike the two dominant pa ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
paradigms, oblivious algorithms do not depend on the input keys and therefore lead to predetermined I/O and communication patterns in an outofcore setting. We have developed several outofcore sorting programs using this paradigm. Our baseline implementation, 3pass columnsort, was based on Leighton’s
PCASIFT: A more distinctive representation for local image descriptors
, 2004
"... Stable local feature detection and representation is a fundamental component of many image registration and object recognition algorithms. Mikolajczyk and Schmid [14] recently evaluated a variety of approaches and identified the SIFT [11] algorithm as being the most resistant to common image deforma ..."
Abstract

Cited by 572 (6 self)
 Add to MetaCart
Analysis (PCA) to the normalized gradient patch. Our experiments demonstrate that the PCAbased local descriptors are more distinctive, more robust to image deformations, and more compact than the standard SIFT representation. We also present results showing that using these descriptors in an image
Why Do Some Countries Produce So Much More Output Per Worker Than Others?
, 1998
"... Output per worker varies enormously across countries. Why? On an accounting basis, our analysis shows that differences in physical capital and educational attainment can only partially explain the variation in output per worker — we find a large amount of variation in the level of the Solow residual ..."
Abstract

Cited by 2363 (22 self)
 Add to MetaCart
Output per worker varies enormously across countries. Why? On an accounting basis, our analysis shows that differences in physical capital and educational attainment can only partially explain the variation in output per worker — we find a large amount of variation in the level of the Solow residual across countries. At a deeper level, we document that the differences in capital accumulation, productivity, and therefore output per worker are driven by differences in institutions and government policies, which we call social infrastructure. We treat social infrastructure as endogenous, determined historically by location and other factors captured in part by language.
Hierarchies from Fluxes in String Compactifications
, 2002
"... Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory a ..."
Abstract

Cited by 724 (33 self)
 Add to MetaCart
Warped compactifications with significant warping provide one of the few known mechanisms for naturally generating large hierarchies of physical scales. We demonstrate that this mechanism is realizable in string theory, and give examples involving orientifold compactifications of IIB string theory and Ftheory compactifications on CalabiYau fourfolds. In each case, the hierarchy of scales is fixed by a choice of RR and NS fluxes in the compact manifold. Our solutions involve compactifications of the KlebanovStrassler gravity dual to a confining N = 1 supersymmetric gauge theory, and the hierarchy reflects the small scale of chiral symmetry breaking in the dual gauge theory.
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 887 (22 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
BDI Agents: From Theory to Practice
 IN PROCEEDINGS OF THE FIRST INTERNATIONAL CONFERENCE ON MULTIAGENT SYSTEMS (ICMAS95
, 1995
"... The study of computational agents capable of rational behaviour has received a great deal of attention in recent years. Theoretical formalizations of such agents and their implementations have proceeded in parallel with little or no connection between them. This paper explores a particular typ ..."
Abstract

Cited by 880 (3 self)
 Add to MetaCart
an ideal theoretical perspective and a more practical perspective; and (c) the building of largescale applications based on BDI agents. In particular, an airtraffic management application will be described from both a theoretical and an implementation perspective.
What Can Economists Learn from Happiness Research?
 FORTHCOMING IN JOURNAL OF ECONOMIC LITERATURE
, 2002
"... Happiness is generally considered to be an ultimate goal in life; virtually everybody wants to be happy. The United States Declaration of Independence of 1776 takes it as a selfevident truth that the “pursuit of happiness” is an “unalienable right”, comparable to life and liberty. It follows that e ..."
Abstract

Cited by 517 (24 self)
 Add to MetaCart
Happiness is generally considered to be an ultimate goal in life; virtually everybody wants to be happy. The United States Declaration of Independence of 1776 takes it as a selfevident truth that the “pursuit of happiness” is an “unalienable right”, comparable to life and liberty. It follows that economics is – or should be – about individual happiness. In particular, the question is how do economic growth, unemployment and inflation, as well as institutional factors such as good governance, affect individual wellbeing? In addition to this intrinsic interest, there are three major reasons for economists to consider happiness. The first is economic policy. At the microlevel, it is often impossible to make a Paretooptimal proposal, because a social action entails costs for some individuals. Hence an evaluation of the net effects, in terms of individual utilities, is needed. On an aggregate level, economic policy must deal with tradeoffs, especially those between unemployment and
Results 1  10
of
4,313,772