Results 1  10
of
1,015,054
Ptolemy: A Framework for Simulating and Prototyping Heterogeneous Systems
, 1992
"... Ptolemy is an environment for simulation and prototyping of heterogeneous systems. It uses modern objectoriented software technology (C++) to model each subsystem in a natural and efficient manner, and to integrate these subsystems into a whole. Ptolemy encompasses practically all aspects of design ..."
Abstract

Cited by 569 (89 self)
 Add to MetaCart
of designing signal processing and communications systems, ranging from algorithms and communication strategies, simulation, hardware and software design, parallel computing, and generating realtime prototypes. To accommodate this breadth, Ptolemy must support a plethora of widelydiffering design styles
Recognitionbycomponents: A theory of human image understanding
 Psychological Review
, 1987
"... The perceptual recognition of objects is conceptualized to be a process in which the image of the input is segmented at regions of deep concavity into an arrangement of simple geometric components, such as blocks, cylinders, wedges, and cones. The fundamental assumption of the proposed theory, recog ..."
Abstract

Cited by 1267 (23 self)
 Add to MetaCart
, recognitionbycomponents (RBC), is that a modest set of generalizedcone components, called geons (N ^ 36), can be derived from contrasts of five readily detectable properties of edges in a twodimensional image: curvature, collinearity, symmetry, parallelism, and cotermmation. The detection
SIMULTANEOUS ANALYSIS OF LASSO AND DANTZIG SELECTOR
 SUBMITTED TO THE ANNALS OF STATISTICS
, 2007
"... We exhibit an approximate equivalence between the Lasso estimator and Dantzig selector. For both methods we derive parallel oracle inequalities for the prediction risk in the general nonparametric regression model, as well as bounds on the ℓp estimation loss for 1 ≤ p ≤ 2 in the linear model when th ..."
Abstract

Cited by 471 (11 self)
 Add to MetaCart
We exhibit an approximate equivalence between the Lasso estimator and Dantzig selector. For both methods we derive parallel oracle inequalities for the prediction risk in the general nonparametric regression model, as well as bounds on the ℓp estimation loss for 1 ≤ p ≤ 2 in the linear model when
Summaries of Affymetrix GeneChip probe level data
 Nucleic Acids Res
, 2003
"... High density oligonucleotide array technology is widely used in many areas of biomedical research for quantitative and highly parallel measurements of gene expression. Affymetrix GeneChip arrays are the most popular. In this technology each gene is typically represented by a set of 11±20 pairs of pr ..."
Abstract

Cited by 470 (21 self)
 Add to MetaCart
High density oligonucleotide array technology is widely used in many areas of biomedical research for quantitative and highly parallel measurements of gene expression. Affymetrix GeneChip arrays are the most popular. In this technology each gene is typically represented by a set of 11±20 pairs
(Tissue) P Systems Working in the kRestricted Minimally Parallel Derivation Mode
"... Just recently several new derivaton modes for (tissue) P systems have been introduced and investigated in addition to the maximally parallel derivation mode used from the beginning in the area of membrane computing. A variant of the minimally parallel derivation is considered in this paper – we allo ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Just recently several new derivaton modes for (tissue) P systems have been introduced and investigated in addition to the maximally parallel derivation mode used from the beginning in the area of membrane computing. A variant of the minimally parallel derivation is considered in this paper – we
Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
"... Abstract. Logic programming, a class of programming languages based on firstorder logic, provides simple and efficient tools for goaloriented proofsearch. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functi ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either Pf Pfcoalgebras or Pf Listcoalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (prooftrees, SLD
Turbo decoding as an instance of Pearl’s belief propagation algorithm
 IEEE Journal on Selected Areas in Communications
, 1998
"... Abstract—In this paper, we will describe the close connection between the now celebrated iterative turbo decoding algorithm of Berrou et al. and an algorithm that has been well known in the artificial intelligence community for a decade, but which is relatively unknown to information theorists: Pear ..."
Abstract

Cited by 404 (16 self)
 Add to MetaCart
: Pearl’s belief propagation algorithm. We shall see that if Pearl’s algorithm is applied to the “belief network ” of a parallel concatenation of two or more codes, the turbo decoding algorithm immediately results. Unfortunately, however, this belief diagram has loops, and Pearl only proved that his
Performance analysis of kary ncube interconnection networks
 IEEE Transactions on Computers
, 1990
"... AbstmctVLSI communication networks are wirelimited. The cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. This paper analyzes communication networks of varying dimension under the assumption of co ..."
Abstract

Cited by 357 (18 self)
 Add to MetaCart
of constant wire bisection. Expressions for the latency, average case throughput, and hotspot throughput of kary ncube networks with constant bisection are derived that agree closely with experimental measurements. It is shown that lowdimensional networks (e.g., tori) have lower latency and higher hot
Schema abstraction‖ in a multipletrace memory model
 Psychological Review
, 1986
"... A simulation model of episodic memory, MINERVA 2, is applied to the learning of concepts, as represented bythe schemaabstraction task. The model assumes that each experience produces a separate memory trace and that knowledge of abstract oncepts i derived from the pool of episodic traces at the tim ..."
Abstract

Cited by 358 (2 self)
 Add to MetaCart
A simulation model of episodic memory, MINERVA 2, is applied to the learning of concepts, as represented bythe schemaabstraction task. The model assumes that each experience produces a separate memory trace and that knowledge of abstract oncepts i derived from the pool of episodic traces
Results 1  10
of
1,015,054