Results 1  10
of
8,712
Framing: toward clarification of a fractured paradigm’’,
 Journal of Communication
, 1993
"... In response to the proposition that communication lacks disciplinary status because of deficient core knowledge, I propose that we turn an ostensible weakness into a strength. We should identify our mission as bringing together insights and theories that would otherwise remain scattered in other di ..."
Abstract

Cited by 620 (1 self)
 Add to MetaCart
its omnipresence across the social sciences and humanities, nowhere is there a general statement of framing theory that shows exactly how frames become embedded within and make themselves manifest in a text, or how framing influences thinking. Analysis of this concept suggests how the discipline
Ktheory for operator algebras
 Mathematical Sciences Research Institute Publications
, 1998
"... p. XII line5: since p. 12: I blew this simple formula: should be α = −〈ξ, η〉/〈η, η〉. p. 2 I.1.1.4: The RieszFischer Theorem is often stated this way today, but neither Riesz nor Fischer (who worked independently) phrased it in terms of completeness of the orthogonal system {e int}. If [a, b] is a ..."
Abstract

Cited by 558 (0 self)
 Add to MetaCart
] is a bounded interval in R, in modern language the original statement of the theorem was that L 2 ([a, b]) is complete and abstractly isomorphic to l 2. According to [Jah03, p. 385], the name “Hilbert space ” was first used in 1908 by A. Schönflies, apparently to refer to what we today call l 2. Von
Some informational aspects of visual perception
 Psychol. Rev
, 1954
"... The ideas of information theory are at present stimulating many different areas of psychological inquiry. In providing techniques for quantifying situations which have hitherto been difficult or impossible to quantify, they suggest new and more precise ways of conceptualizing these situations (see M ..."
Abstract

Cited by 643 (2 self)
 Add to MetaCart
Miller [12] for a general discussion and bibliography). Events ordered in time are particularly amenable to informational analysis; thus language sequences are being extensively studied, and other sequences, such as those of music, plainly invite research. In this paper I shall indicate some of the ways
WaitFree Synchronization
 ACM Transactions on Programming Languages and Systems
, 1993
"... A waitfree implementation of a concurrent data object is one that guarantees that any process can complete any operation in a finite number of steps, regardless of the execution speeds of the other processes. The problem of constructing a waitfree implementation of one data object from another lie ..."
Abstract

Cited by 851 (28 self)
 Add to MetaCart
lies at the heart of much recent work in concurrent algorithms, concurrent data structures, and multiprocessor architectures. In the first part of this paper, we introduce a simple and general technique, based on reduction to a consensus protocol, for proving statements of the form "
Bayesian Network Classifiers
, 1997
"... Recent work in supervised learning has shown that a surprisingly simple Bayesian classifier with strong assumptions of independence among features, called naive Bayes, is competitive with stateoftheart classifiers such as C4.5. This fact raises the question of whether a classifier with less restr ..."
Abstract

Cited by 796 (20 self)
 Add to MetaCart
restrictive assumptions can perform even better. In this paper we evaluate approaches for inducing classifiers from data, based on the theory of learning Bayesian networks. These networks are factored representations of probability distributions that generalize the naive Bayesian classifier and explicitly
ALGORITHMS FOR THE ASSIGNMENT AND TRANSPORTATION PROBLEMS
, 1957
"... In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated p ..."
Abstract

Cited by 454 (0 self)
 Add to MetaCart
In this paper we presen algorithms for the solution of the general assignment and transportation problems. In Section 1, a statement of the algorithm for the assignment problem appears, along with a proof for the correctness of the algorithm. The remarks which constitute the proof are incorporated
Theory for the development of neuron selectivity: orientation specificity and binocular interaction in visual cortex
 J. Neurosci
, 1982
"... The development of stimulus selectivity in the primary sensory cortex of higher vertebrates is considered in a general mathematical framework. A synaptic evolution scheme of a new kind is proposed in which incoming patterns rather than converging afferents compete. The change in the efficacy of a gi ..."
Abstract

Cited by 432 (20 self)
 Add to MetaCart
The development of stimulus selectivity in the primary sensory cortex of higher vertebrates is considered in a general mathematical framework. A synaptic evolution scheme of a new kind is proposed in which incoming patterns rather than converging afferents compete. The change in the efficacy of a
Dynamic Program Slicing
, 1990
"... The conventional notion of a program slicethe set of all statements that might affect the value of a variable occurrenceis totally independent of the program input values. Program debugging, however, involves analyzing the program behavior under the specific inputs that revealed the bug. In th ..."
Abstract

Cited by 415 (7 self)
 Add to MetaCart
The conventional notion of a program slicethe set of all statements that might affect the value of a variable occurrenceis totally independent of the program input values. Program debugging, however, involves analyzing the program behavior under the specific inputs that revealed the bug
Annotea: An Open RDF Infrastructure for Shared Web Annotations
, 2001
"... Annotea is a Webbased shared annotation system based on a generalpurpose open RDF infrastructure, where annotations are modeled as a class of metadata. Annotations are viewed as statements made by an author about a Web document. Annotations are external to the documents and can be stored in one or ..."
Abstract

Cited by 375 (3 self)
 Add to MetaCart
Annotea is a Webbased shared annotation system based on a generalpurpose open RDF infrastructure, where annotations are modeled as a class of metadata. Annotations are viewed as statements made by an author about a Web document. Annotations are external to the documents and can be stored in one
CODI: Combinatorial Optimization for Data Integration – Results for OAEI 2011
"... Abstract. In this paper, we describe our probabilisticlogical alignment system CODI (Combinatorial Optimization for Data Integration). The system provides a declarative framework for the alignment of individuals, concepts, and properties of two heterogeneous ontologies. CODI leverages both logical ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
schema information and lexical similarity measures with a welldefined semantics for ABox and TBox matching. The alignments are computed by solving corresponding combinatorial optimization problems. 1 Presentation of the system 1.1 State, purpose, general statement CODI (Combinatorial Optimization
Results 1  10
of
8,712