Results 1  10
of
2,962,042
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 526 (72 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
An extended set of Haarlike features for rapid objection detection
 IEEE ICIP
"... Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haarlike features. These novel features significantly enrich the simple features of [5] and can also be calculated ef ..."
Abstract

Cited by 567 (4 self)
 Add to MetaCart
Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple feature classifiers. In this paper we introduce a novel set of rotated haarlike features. These novel features significantly enrich the simple features of [5] and can also be calculated
Minimal Extending Sets in Tournaments
, 2013
"... Tournament solutions, i.e., functions that associate with each complete and asymmetric relation on a set of alternatives a nonempty subset of the alternatives, play an important role within social choice theory and the mathematical social sciences at large. In 2011, Brandt proposed a new tourname ..."
Abstract
 Add to MetaCart
tournament solution called the minimal extending set (ME) and an associated graphtheoretic conjecture. If the conjecture had been true, ME would have satisfied virtually all desirable properties that are usually considered in the literature on tournament solutions. However, in 2013, the existence
The Extended Linear Complementarity Problem
, 1993
"... We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the biline ..."
Abstract

Cited by 776 (28 self)
 Add to MetaCart
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity
Possessions and the Extended Self
 Journal of Consumer Research
, 1988
"... Our possessions are a major contributor to and reflection of our identities. A variety of evidence is presented supporting this simple and compelling premise. Related streans of research are identified and drawn upon in devetopJng this concept and implications are derived for consumer behavior. Beca ..."
Abstract

Cited by 544 (2 self)
 Add to MetaCart
Our possessions are a major contributor to and reflection of our identities. A variety of evidence is presented supporting this simple and compelling premise. Related streans of research are identified and drawn upon in devetopJng this concept and implications are derived for consumer behavior. Because the construct of exterxJed self involves consumer behavior rather than buyer behavior. It apjpears to be a much richer construct than previous formulations positing a relationship between selfconcept and consumer brand choice. Hollow hands clasp ludicrous possessions because they are links in the chain of life If it breaks, they are truly losL—Dichlsr \ 964 W e cannot hope to understand consumer behavior without first gaining some understanding of ihe meanings that consumers attach to possessions..• \ key to understanding what possessions mean is recognizing thai, knowingly or unknowingly, intentionally or unintentionally, we regard our possessions as parts of ourselves. As Tuan argues, "Our fragile sense
EXTENDIBLE SETS IN PEANO ARITHMETIC
"... Abstract. Let sf be a structure and let U be a subset of \sf\. We say U is extendible if whenever 3S is an elementary extension of so?.there is a V Ç \£§\ such that (sf, U)< (SS, V). Our main results are: If Jt is a countable model of Peano arithmetic and U is a subset of #, then U is extendi ..."
Abstract
 Add to MetaCart
Abstract. Let sf be a structure and let U be a subset of \sf\. We say U is extendible if whenever 3S is an elementary extension of so?.there is a V Ç \£§\ such that (sf, U)< (SS, V). Our main results are: If Jt is a countable model of Peano arithmetic and U is a subset of #, then U
AXIOMS AND MODELS FOR AN EXTENDED SET THEORY
"... Abstract. We present the axioms of extended set theory (XST) and the ideas underlying the axioms. We also present an interpretation of XST in ZFC plus “there exist arbitrarily large inaccessible cardinals, ” thereby proving the consistency of XST relative to this mild largecardinal extension of ZFC ..."
Abstract
 Add to MetaCart
Abstract. We present the axioms of extended set theory (XST) and the ideas underlying the axioms. We also present an interpretation of XST in ZFC plus “there exist arbitrarily large inaccessible cardinals, ” thereby proving the consistency of XST relative to this mild largecardinal extension
The SimpleScalar tool set, version 2.0
 Computer Architecture News
, 1997
"... This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces, bette ..."
Abstract

Cited by 1827 (44 self)
 Add to MetaCart
This report describes release 2.0 of the SimpleScalar tool set, a suite of free, publicly available simulation tools that offer both detailed and highperformance simulation of modern microprocessors. The new release offers more tools and capabilities, precompiled binaries, cleaner interfaces
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NP
Shape modeling with front propagation: A level set approach
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1995
"... Abstract Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods ..."
Abstract

Cited by 804 (20 self)
 Add to MetaCart
secting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a “HamiltonJacob? ’ type equation written for a function in which the interface is a particular level set. A speed term synthesizpd from the image is used to stop the interface
Results 1  10
of
2,962,042