Results 1  10
of
5,298
OVER F2 AND F3
"... Abstract. We consider arrays of size 2 × 2 × 2 and 2 × 2 × 2 × 2 over the fields with two and three elements. We use computer algebra to determine the canonical forms of these arrays with respect to the action of the semidirect product of general linear groups with the symmetric group. For each cano ..."
Abstract
 Add to MetaCart
Abstract. We consider arrays of size 2 × 2 × 2 and 2 × 2 × 2 × 2 over the fields with two and three elements. We use computer algebra to determine the canonical forms of these arrays with respect to the action of the semidirect product of general linear groups with the symmetric group. For each
Session F3A
"... NetExam is a webbased testing engine. In addition to automated testing and grading capabilities, NetExam computes statistics that are tied directly to program outcomes, for ABET2000 assessment purposes. NetExam provides advantages over scantronstyle testing as it also presents statistics on progra ..."
Abstract
 Add to MetaCart
NetExam is a webbased testing engine. In addition to automated testing and grading capabilities, NetExam computes statistics that are tied directly to program outcomes, for ABET2000 assessment purposes. NetExam provides advantages over scantronstyle testing as it also presents statistics
InductiveDataType Systems
, 2002
"... In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the leI two authors presented a combined lmbined made of a (strongl normal3zG9 alrmal rewrite system and a typed #calA#Ik enriched by patternmatching definitions folnitio a certain format,calat the "General Schem ..."
Abstract

Cited by 821 (23 self)
 Add to MetaCart
;General Schema", whichgeneral39I theusual recursor definitions fornatural numbers and simil9 "basic inductive types". This combined lmbined was shown to bestrongl normalIk39f The purpose of this paper is toreformul33 and extend theGeneral Schema in order to make it easil extensibl3 to capture a
MAFFT version 5: improvement in accuracy of multiple sequence alignment
 NUCLEIC ACIDS RES
, 2005
"... The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed high ..."
Abstract

Cited by 801 (5 self)
 Add to MetaCart
The accuracy of multiple sequence alignment program MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, HINSi, FINSi and GINSi, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed
Shape and motion from image streams under orthography: a factorization method
 INTERNATIONAL JOURNAL OF COMPUTER VISION
, 1992
"... Inferring scene geometry and camera motion from a stream of images is possible in principle, but is an illconditioned problem when the objects are distant with respect to their size. We have developed a factorization method that can overcome this difficulty by recovering shape and motion under orth ..."
Abstract

Cited by 1094 (38 self)
 Add to MetaCart
orthography without computing depth as an intermediate step. An image stream can be represented by the 2FxP measurement matrix of the image coordinates of P points tracked through F frames. We show that under orthographic projection this matrix is of rank 3. Based on this observation, the factorization method
F.3.2 [Logics and Meanings of Programs]: Semantics of
"... Approximate computations (for example, video, audio, and image processing, machine learning, and many scientific computations) have the freedom to generate a range of acceptable results. Approximate program transformations (for example, task skipping and loop perforation) exploit this freedom to pro ..."
Abstract
 Add to MetaCart
Approximate computations (for example, video, audio, and image processing, machine learning, and many scientific computations) have the freedom to generate a range of acceptable results. Approximate program transformations (for example, task skipping and loop perforation) exploit this freedom
Categories and Subject Descriptors F. Theory of computation [F.3 Logics and Meanings of Programs]: F.3.1 Specifying and Verifying and Reasoning about Programs
"... A significant body of parallel programs are written using MPI [1]. Bugs in MPI programs arise due to many reasons, for example: (i) during manual optimizations that turn blocking sends/receives into their nonblocking counterparts, (ii) in the context of using ..."
Abstract
 Add to MetaCart
A significant body of parallel programs are written using MPI [1]. Bugs in MPI programs arise due to many reasons, for example: (i) during manual optimizations that turn blocking sends/receives into their nonblocking counterparts, (ii) in the context of using
Module 3F5: Computer Systems
"... Computer Architecture is the science and art of designing and interconnecting hardware components to create computers that meet functional, performance and cost goals. Computer Architecture is not about using computers to design ..."
Abstract
 Add to MetaCart
Computer Architecture is the science and art of designing and interconnecting hardware components to create computers that meet functional, performance and cost goals. Computer Architecture is not about using computers to design
On the Folkman Number f(2, 3, 4)
, 2007
"... Let f(2, 3, 4) denote the smallest integer n such that there exists a K4free graph of order n for which any 2coloring of its edges yields at least one monochromatic triangle. It is wellknown that such a number must exist. For a long time the best known upper bound, provided by J. Spencer, said th ..."
Abstract
 Add to MetaCart
that f(2, 3, 4) < 3 · 10 9. Recently, L. Lu announced that f(2, 3, 4) < 10 000. In this note, we will give a computer assisted proof showing that f(2, 3, 4) < 1000. To prove it we will generalize the idea of Goodman giving a necessary and sufficient condition for a graph G to yield a
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
is determined by computing its expected (under the riskneutral measure) future cash flows discounted at the riskfree rate. As the credit spread CS(t) is uniquely defined through: (1) the price of a debt claim, (2) this debt claim's contractual cash flows, and (3) the (appropriate) riskfree rate, we can
Results 1  10
of
5,298