Results 1 - 10 of 535,998

Automating the Design of Graphical Presentations of Relational Information

by Jock Mackinlay - ACM Transactions on Graphics , 1986
"... The goal of the research described in this paper is to develop an application-independent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal: The codi ..."
Abstract - Cited by 559 (9 self) - Add to MetaCart
The goal of the research described in this paper is to develop an application-independent presentation tool that automatically designs effective graphical presentations (such as bar charts, scatter plots, and connected graphs) of relational information. Two problems are raised by this goal

AN n 5/2 ALGORITHM FOR MAXIMUM MATCHINGS IN BIPARTITE GRAPHS

by John E. Hopcroft, Richard M. Karp , 1973
"... The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/. ..."
Abstract - Cited by 702 (1 self) - Add to MetaCart
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m + n)x/.

A Fast Algorithm for Particle Simulations

by L. Greengard, V. Rokhlin , 1987
"... this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions a ..."
Abstract - Cited by 1152 (19 self) - Add to MetaCart
this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions

Applications Of Circumscription To Formalizing Common Sense Knowledge

by John McCarthy - Artificial Intelligence , 1986
"... We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects o ..."
Abstract - Cited by 532 (12 self) - Add to MetaCart
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The applications in this paper are mostly based on minimizing the abnormality of different aspects

Answering the Skeptics: Yes, Standard Volatility Models Do Provide Accurate Forecasts

by Torben G. Andersen, Tim Bollerslev
"... Volatility permeates modern financial theories and decision making processes. As such, accurate measures and good forecasts of future volatility are critical for the implementation and evaluation of asset and derivative pricing theories as well as trading and hedging strategies. In response to this, ..."
Abstract - Cited by 561 (45 self) - Add to MetaCart
volatility persistence. Meanwhile, when judged by standard forecast evaluation criteria, based on the squared or absolute returns over daily or longer forecast horizons, standard volatility models provide seemingly poor forecasts. The present paper demonstrates that, contrary to this contention

The particel swarm: Explosion, stability, and convergence in a multi-dimensional complex space

by Maurice Clerc, James Kennedy - IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTION
"... The particle swarm is an algorithm for finding optimal regions of complex search spaces through interaction of individuals in a population of particles. Though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately explained ..."
Abstract - Cited by 852 (10 self) - Add to MetaCart
explained how it works. Further, traditional versions of the algorithm have had some dynamical properties that were not considered to be desirable, notably the particles’ velocities needed to be limited in order to control their trajectories. The present paper analyzes the particle’s trajectory as it moves

A statistical approach to machine translation

by Peter F. Brown, John Cocke, Stephen A. Della Pietra, Vincent J. Della Pietra, Fredrick Jelinek, John D. Lafferty, Robert L. Mercer, Paul S. Roossin - COMPUTATIONAL LINGUISTICS , 1990
"... In this paper, we present a statistical approach to machine translation. We describe the application of our approach to translation from French to English and give preliminary results. ..."
Abstract - Cited by 723 (8 self) - Add to MetaCart
In this paper, we present a statistical approach to machine translation. We describe the application of our approach to translation from French to English and give preliminary results.

Improved Statistical Alignment Models

by Franz Josef Och, Hermann Ney - In Proceedings of the 38th Annual Meeting of the Association for Computational Linguistics , 2000
"... In this paper, we present and compare various single-word based alignment models for statistical machine translation. We discuss the five IBM alignment models, the Hidden-Markov alignment model, smoothing techniques and various modifications. ..."
Abstract - Cited by 607 (12 self) - Add to MetaCart
In this paper, we present and compare various single-word based alignment models for statistical machine translation. We discuss the five IBM alignment models, the Hidden-Markov alignment model, smoothing techniques and various modifications.

Voronoi diagrams -- a survey of a fundamental geometric data structure

by Franz Aurenhammer - ACM COMPUTING SURVEYS , 1991
"... This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development. ..."
Abstract - Cited by 743 (5 self) - Add to MetaCart
This paper presents a survey of the Voronoi diagram, one of the most fundamental data structures in computational geometry. It demonstrates the importance and usefulness of the Voronoi diagram in a wide variety of fields inside and outside computer science and surveys the history of its development

The Magma Algebra System I: The User Language

by Wieb Bosma , John Cannon , Catherine Playoust , 1997
"... In the first of two papers on Magma, a new system for computational algebra, we present the Magma language, outline the design principles and theoretical background, and indicate its scope and use. Particular attention is given to the constructors for structures, maps, and sets. ..."
Abstract - Cited by 1346 (7 self) - Add to MetaCart
In the first of two papers on Magma, a new system for computational algebra, we present the Magma language, outline the design principles and theoretical background, and indicate its scope and use. Particular attention is given to the constructors for structures, maps, and sets.
Results 1 - 10 of 535,998