Results 1  10
of
632,366
Retrocausality at no extra cost
, 2010
"... One obstacle faced by proposals of retrocausal influences in quantum mechanics is the perceived high conceptual cost of making such a proposal. I assemble here a metaphysical picture consistent with the possibility of retrocausality and not precluded by the known physical structure of our reality. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
One obstacle faced by proposals of retrocausal influences in quantum mechanics is the perceived high conceptual cost of making such a proposal. I assemble here a metaphysical picture consistent with the possibility of retrocausality and not precluded by the known physical structure of our reality
CostAware WWW Proxy Caching Algorithms
 IN PROCEEDINGS OF THE 1997 USENIX SYMPOSIUM ON INTERNET TECHNOLOGY AND SYSTEMS
, 1997
"... Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and nonparameterized fash ..."
Abstract

Cited by 544 (6 self)
 Add to MetaCart
Web caches can not only reduce network traffic and downloading latency, but can also affect the distribution of web traffic over the network through costaware caching. This paper introduces GreedyDualSize, which incorporates locality with cost and size concerns in a simple and non
Guarding art galleries: The extra cost for sculptures is linear
 In Proc. of the 11th Scandinavian Workshop on Algorithm Theory (SWAT’08
, 2008
"... Abstract. Art gallery problems are, broadly speaking, the study of the relation between the shapes of regions in the plane and the number of points needed to guard them. These problems have been extensively studied over the last decade and have found different type of applications in practical situa ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. Art gallery problems are, broadly speaking, the study of the relation between the shapes of regions in the plane and the number of points needed to guard them. These problems have been extensively studied over the last decade and have found different type of applications in practical situation. Normally the number of sides of a polygon or the general shape of the polygon is used as a measure of the complexity of the problem. The aim of this paper is to present and explore another measure of complexity, namely, the number of guards required to guard the boundary, or the walls, of the gallery. We prove that if n guards are necessary to guard the walls of an art gallery, then an additional team of at most 4n − 6 will guard the whole gallery. This result improves a previously known quadratic bound, and is a step towards a possibly optimal value of n − 2 additional guards. The proof is algorithmic, uses ideas from graph theory (visibility graph induced on the already placed guards), and is mainly based on the definition of a new reduction operator which recursively eliminates the simple parts of the polygon. We also use the fact that every gallery with c rightturn angles can be guarded by at most 2c − 4 guards. This latter result is optimal. 1 Painting Galleries Introduction. Art gallery problems are, broadly speaking, the study of the relation between the shapes
Multimarket Oligopoly: Strategic Substitutes and complements
 JOURNAL OF POLITICAL ECONOMY
"... A firm’s actions in one market can change competitors’ strategies in a second market by affecting its own marginal costs in that other market. Whether the action provides costs or benefits in the second market depends on (a) whether it increases or decreases marginal costs in the second market and ..."
Abstract

Cited by 601 (10 self)
 Add to MetaCart
A firm’s actions in one market can change competitors’ strategies in a second market by affecting its own marginal costs in that other market. Whether the action provides costs or benefits in the second market depends on (a) whether it increases or decreases marginal costs in the second market
Usability Analysis of Visual Programming Environments: a `cognitive dimensions' framework
 JOURNAL OF VISUAL LANGUAGES AND COMPUTING
, 1996
"... The cognitive dimensions framework is a broadbrush evaluation technique for interactive devices and for noninteractive notations. It sets out a small vocabulary of terms designed to capture the cognitivelyrelevant aspects of structure, and shows how they can be traded off against each other. T ..."
Abstract

Cited by 510 (13 self)
 Add to MetaCart
' (possibility of conveying extra meaning by choice of layout, colour, etc.).
The theory and practice of corporate finance: Evidence from the field
 Journal of Financial Economics
, 2001
"... We survey 392 CFOs about the cost of capital, capital budgeting, and capital structure. Large firms rely heavily on present value techniques and the capital asset pricing model, while small firms are relatively likely to use the payback criterion. We find that a surprising number of firms use their ..."
Abstract

Cited by 680 (20 self)
 Add to MetaCart
We survey 392 CFOs about the cost of capital, capital budgeting, and capital structure. Large firms rely heavily on present value techniques and the capital asset pricing model, while small firms are relatively likely to use the payback criterion. We find that a surprising number of firms use
Bundle Adjustment  A Modern Synthesis
 VISION ALGORITHMS: THEORY AND PRACTICE, LNCS
, 2000
"... This paper is a survey of the theory and methods of photogrammetric bundle adjustment, aimed at potential implementors in the computer vision community. Bundle adjustment is the problem of refining a visual reconstruction to produce jointly optimal structure and viewing parameter estimates. Topics c ..."
Abstract

Cited by 555 (12 self)
 Add to MetaCart
covered include: the choice of cost function and robustness; numerical optimization including sparse Newton methods, linearly convergent approximations, updating and recursive methods; gauge (datum) invariance; and quality control. The theory is developed for general robust cost functions rather than
The pyramid match kernel: Discriminative classification with sets of image features
 IN ICCV
, 2005
"... Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernelbased classification methods can learn complex decision boundaries, but a kernel over unordered set inputs must somehow solve for correspondenc ..."
Abstract

Cited by 546 (29 self)
 Add to MetaCart
in the number of features, and it implicitly finds correspondences based on the finest resolution histogram cell where a matched pair first appears. Since the kernel does not penalize the presence of extra features, it is robust to clutter. We show the kernel function is positivedefinite, making it valid
Implications of rational inattention
 JOURNAL OF MONETARY ECONOMICS
, 2002
"... A constraint that actions can depend on observations only through a communication channel with finite Shannon capacity is shown to be able to play a role very similar to that of a signal extraction problem or an adjustment cost in standard control problems. The resulting theory looks enough like fa ..."
Abstract

Cited by 514 (10 self)
 Add to MetaCart
A constraint that actions can depend on observations only through a communication channel with finite Shannon capacity is shown to be able to play a role very similar to that of a signal extraction problem or an adjustment cost in standard control problems. The resulting theory looks enough like
Learning to rank using gradient descent
 In ICML
, 2005
"... We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data f ..."
Abstract

Cited by 510 (17 self)
 Add to MetaCart
We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data
Results 1  10
of
632,366