Results 1  10
of
9,263
Computing the Frequency of Partial Orders
"... Abstract. In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting that partial order. The first two algorithms count by enumerating all solutions to a CSP. However, large number ..."
Abstract
 Add to MetaCart
Abstract. In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting that partial order. The first two algorithms count by enumerating all solutions to a CSP. However, large
Matching pursuits with timefrequency dictionaries
 IEEE Transactions on Signal Processing
, 1993
"... AbstractWe introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions. These waveforms are chosen in order to best match the signal structures. Matching pursuits are general procedures t ..."
Abstract

Cited by 1671 (13 self)
 Add to MetaCart
to compute adaptive signal representations. With a dictionary of Gabor functions a matching pursuit defines an adaptive timefrequency transform. We derive a signal energy distribution in the timefrequency plane, which does not include interference terms, unlike Wigner and Cohen class distributions. A
Modeling and simulation of genetic regulatory systems: A literature review
 JOURNAL OF COMPUTATIONAL BIOLOGY
, 2002
"... In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between ..."
Abstract

Cited by 738 (14 self)
 Add to MetaCart
In order to understand the functioning of organisms on the molecular level, we need to know which genes are expressed, when and where in the organism, and to which extent. The regulation of gene expression is achieved through genetic regulatory systems structured by networks of interactions between
Video google: A text retrieval approach to object matching in videos
 In ICCV
, 2003
"... We describe an approach to object and scene retrieval which searches for and localizes all the occurrences of a user outlined object in a video. The object is represented by a set of viewpoint invariant region descriptors so that recognition can proceed successfully despite changes in viewpoint, ill ..."
Abstract

Cited by 1636 (42 self)
 Add to MetaCart
, illumination and partial occlusion. The temporal continuity of the video within a shot is used to track the regions in order to reject unstable regions and reduce the effects of noise in the descriptors. The analogy with text retrieval is in the implementation where matches on descriptors are precomputed
Unsupervised texture segmentation using Gabor filters
 Pattern Recognition
"... We presenf a texture segmentation algorithm inspired by the multichannel filtering theory for visual information processing in the early stages of human visual system. The channels are characterized by a bank of Gabor filters that nearly uniformly covers the spatialfrequency domain. We propose a s ..."
Abstract

Cited by 616 (20 self)
 Add to MetaCart
We presenf a texture segmentation algorithm inspired by the multichannel filtering theory for visual information processing in the early stages of human visual system. The channels are characterized by a bank of Gabor filters that nearly uniformly covers the spatialfrequency domain. We propose a
Computation and Analysis of Multiple Structural Change Models.‖
 Journal of Applied Econometrics
, 2003
"... SUMMARY In a recent paper, Bai and Perron (1998) considered theoretical issues related to the limiting distribution of estimators and test statistics in the linear model with multiple structural changes. In this companion paper, we consider practical issues for the empirical applications of the pro ..."
Abstract

Cited by 448 (6 self)
 Add to MetaCart
of the procedures. We first address the problem of estimation of the break dates and present an efficient algorithm to obtain global minimizers of the sum of squared residuals. This algorithm is based on the principle of dynamic programming and requires at most leastsquares operations of order O T 2 for any number
A mammalian microRNA expression atlas based on small RNA library sequencing.
 Cell,
, 2007
"... SUMMARY MicroRNAs (miRNAs) are small noncoding regulatory RNAs that reduce stability and/or translation of fully or partially sequencecomplementary target mRNAs. In order to identify miRNAs and to assess their expression patterns, we sequenced over 250 small RNA libraries from 26 different organ sy ..."
Abstract

Cited by 418 (4 self)
 Add to MetaCart
SUMMARY MicroRNAs (miRNAs) are small noncoding regulatory RNAs that reduce stability and/or translation of fully or partially sequencecomplementary target mRNAs. In order to identify miRNAs and to assess their expression patterns, we sequenced over 250 small RNA libraries from 26 different organ
A column approximate minimum degree ordering algorithm
, 2000
"... Sparse Gaussian elimination with partial pivoting computes the factorization PAQ = LU of a sparse matrix A, where the row ordering P is selected during factorization using standard partial pivoting with row interchanges. The goal is to select a column preordering, Q, based solely on the nonzero patt ..."
Abstract

Cited by 318 (52 self)
 Add to MetaCart
Sparse Gaussian elimination with partial pivoting computes the factorization PAQ = LU of a sparse matrix A, where the row ordering P is selected during factorization using standard partial pivoting with row interchanges. The goal is to select a column preordering, Q, based solely on the nonzero
On visible surface generation by a priori tree structures
 Computer Graphics
, 1980
"... This paper describes a new algorithm for solving the hidden surface (or line) problem, to more rapidly generate realistic images of 3D scenes composed of polygons, and presents the development of theoretical foundations in the area as well as additional related algorithms. As in many applications t ..."
Abstract

Cited by 370 (6 self)
 Add to MetaCart
the environment to be displayed consists of polygons many of whose relative geometric relations are static, we attempt to capitalize on this by pre processing tile environment,s database so as to decrease the runtime computations required to generate a scene. This preprocessing is based on generating a &
A Framework for Comparing Models of Computation
 IEEE TRANSACTIONS ON COMPUTERAIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS
, 1998
"... We give a denotational framework (a “meta model”) within which certain properties of models of computation can be compared. It describes concurrent processes in general terms as sets of possible behaviors. A process is determinate if, given the constraints imposed by the inputs, there are exactly o ..."
Abstract

Cited by 322 (67 self)
 Add to MetaCart
partially ordered or totally ordered set. Timed models are where the set of tags is totally ordered. Synchronous events share the same tag, and synchronous signals contain events with the same set of tags. Synchronous processes have only synchronous signals as behaviors. Strict causality (in timed tag
Results 1  10
of
9,263