Results 1 - 10 of 76,899

A Syntactic Approach to Type Soundness

by Andrew K. Wright, Matthias Felleisen - INFORMATION AND COMPUTATION , 1992
"... We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract - Cited by 629 (22 self) - Add to MetaCart
of the language semantics. The approach easily extends from polymorphic functional languages to imperative languages that provide references, exceptions, continuations, and similar features. We illustrate the technique with a type soundness theorem for the core of Standard ML, which includes the first type

The eyes have it: A task by data type taxonomy for information visualizations

by Ben Shneiderman - IN IEEE SYMPOSIUM ON VISUAL LANGUAGES , 1996
"... A useful starting point for designing advanced graphical user interjaces is the Visual lnformation-Seeking Mantra: overview first, zoom and filter, then details on demand. But this is only a starting point in trying to understand the rich and varied set of information visualizations that have been ..."
Abstract - Cited by 1265 (28 self) - Add to MetaCart
A useful starting point for designing advanced graphical user interjaces is the Visual lnformation-Seeking Mantra: overview first, zoom and filter, then details on demand. But this is only a starting point in trying to understand the rich and varied set of information visualizations that have been

A Survey of Image Registration Techniques

by Lisa Gottesfeld Brown - ACM Computing Surveys , 1992
"... Registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different times, from different sensors or from different viewpoints. Over the years, a broad range of techniques have been developed for the various types of data and problems. These ..."
Abstract - Cited by 979 (2 self) - Add to MetaCart
of distortions are distinguished. The first type are those which are the source of misregistration, i.e., they are the cause of the misalignment between the two images. Distortions which are the source of misregistration determine the transformation class which will optimally align the two images

An Algorithm for Tracking Multiple Targets

by Donald B. Reid - IEEE Transactions on Automatic Control , 1979
"... Abstract—An algorithm for tracking multiple targets In a cluttered algorithms. Clustering is the process of dividing the entire environment Is developed. The algorithm Is capable of Initiating tracks, set of targets and measurements into independent groups accounting for false or m[~clngreports, and ..."
Abstract - Cited by 596 (0 self) - Add to MetaCart
types of sensors. The first type is capable of nique allows correlation of a asurement with Its a based on sending information which can be used to infer the numsubsequent, as well as previous, data. To keep the number of hypotheses ber of targets within the area of coverage of the sensor reasonable

A semantics of multiple inheritance

by Luca Cardelli - Information and Computation , 1988
"... There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types) and func ..."
Abstract - Cited by 528 (9 self) - Add to MetaCart
There are two major ways of structuring data in programming languages. The first and common one, used for example in Pascal, can be said to derive from standard branches of mathematics. Data is organized as cartesian products (i.e. record types), disjoint sums (i.e. unions or variant types

Featherweight Java: A Minimal Core Calculus for Java and GJ

by Atsushi Igarashi, Benjamin C. Pierce, Philip Wadler - ACM Transactions on Programming Languages and Systems , 1999
"... Several recent studies have introduced lightweight versions of Java: reduced languages in which complex features like threads and reflection are dropped to enable rigorous arguments about key properties such as type safety. We carry this process a step further, omitting almost all features of the fu ..."
Abstract - Cited by 659 (23 self) - Add to MetaCart
, and Wadler) and give a detailed proof of type safety. The extended system formalizes for the first time some of the key features

Generic Schema Matching with Cupid

by Jayant Madhavan, Philip Bernstein, Erhard Rahm - In The VLDB Journal , 2001
"... Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past s ..."
Abstract - Cited by 604 (17 self) - Add to MetaCart
Schema matching is a critical step in many applications, such as XML message mapping, data warehouse loading, and schema integration. In this paper, we investigate algorithms for generic schema matching, outside of any particular data model or application. We first present a taxonomy for past

A tutorial on hidden Markov models and selected applications in speech recognition

by Lawrence R. Rabiner - PROCEEDINGS OF THE IEEE , 1989
"... Although initially introduced and studied in the late 1960s and early 1970s, statistical methods of Markov source or hidden Markov modeling have become increasingly popular in the last several years. There are two strong reasons why this has occurred. First the models are very rich in mathematical s ..."
Abstract - Cited by 5892 (1 self) - Add to MetaCart
Although initially introduced and studied in the late 1960s and early 1970s, statistical methods of Markov source or hidden Markov modeling have become increasingly popular in the last several years. There are two strong reasons why this has occurred. First the models are very rich in mathematical

Basic concepts and taxonomy of dependable and secure computing

by Algirdas Avizienis, Jean-claude Laprie, Brian Randell, Carl Landwehr - IEEE TDSC , 2004
"... This paper gives the main definitions relating to dependability, a generic concept including as special case such attributes as reliability, availability, safety, integrity, maintainability, etc. Security brings in concerns for confidentiality, in addition to availability and integrity. Basic defin ..."
Abstract - Cited by 779 (6 self) - Add to MetaCart
definitions are given first. They are then commented upon, and supplemented by additional definitions, which address the threats to dependability and security (faults, errors, failures), their attributes, and the means for their achievement (fault prevention, fault tolerance, fault removal, fault forecasting

The struggle to govern the commons

by Thomas Dietz, Elinor Ostrom, Paul C. Stern - Science , 2003
"... Human institutions—ways of organizing activities—affect the resilience of the environ-ment. Locally evolved institutional arrangements governed by stable communities and buffered from outside forces have sustained resources successfully for centuries, al-though they often fail when rapid change occu ..."
Abstract - Cited by 661 (17 self) - Add to MetaCart
parties, officials, and scientists; complex, redundant, and layered institutions; a mix of institu-tional types; and designs that facilitate experimentation, learning, and change. In 1968, Hardin (1) drew attention to two human factors that drive environmental change. The first factor is the increasing de
Results 1 - 10 of 76,899