Results 1  10
of
1,894,512
The RC5 Encryption Algorithm
, 1995
"... Abstract. This document describes the RC5 encryption algorithm. RC5 is a fast symmetric block cipher suitable for hardware or software implementations. A novel feature of RC5 is the heavy use of datadependent rotations. RC5 has a variable word size, a variable number of rounds, and a variablelengt ..."
Abstract

Cited by 360 (7 self)
 Add to MetaCart
are each 2w bits long. r This is the number of rounds. Also, the expanded key table S contains t =2(r +1)words. Allowable values of r are 0, 1,..., 255. In addition to w and r, RC5 has a variablelength secret cryptographic key, speci ed parameters b and K: b The number of bytes in the secret key K
Monomial ideals
 Mathematical Computations with Macaulay 2
, 2002
"... Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic geo ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic
Image Segmentation by Data Driven Markov Chain Monte Carlo
, 2001
"... This paper presents a computational paradigm called Data Driven Markov Chain Monte Carlo (DDMCMC) for image segmentation in the Bayesian statistical framework. The paper contributes to image segmentation in three aspects. Firstly, it designs effective and well balanced Markov Chain dynamics to exp ..."
Abstract

Cited by 277 (32 self)
 Add to MetaCart
for computing multiple distinct solutions to incorporates intrinsic ambiguities in image segmentation. A kadventurers algorithm is proposed for extracting distinct multiple solutions from the Markov chain sequence. Thirdly, it utilizes datadriven (bottomup) techniques, such as clustering and edge detection
Objects and Views
 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA
, 1991
"... Objectoriented databases have been introduced primarily to ease the development of database applications. However, the difficulties encountered when, for instance, trying to restructure data or integrate databases demonstrate that the models being used still lack flexibility. We claim that the natu ..."
Abstract

Cited by 258 (9 self)
 Add to MetaCart
Objectoriented databases have been introduced primarily to ease the development of database applications. However, the difficulties encountered when, for instance, trying to restructure data or integrate databases demonstrate that the models being used still lack flexibility. We claim that the natural way to overcome these shortcomings is to introduce a sophisticated view mechanism. This paper presents such a mechanism, one which allows a programmer to restructure the class hierarchy and modify the behavior and structure of objects. The mechanism allows a programmer to specify attribute values implicitly, rather than storing them. It also allows him to introduce new classes into the class hierarchy. These virtual classes are populated by selecting existing objects from other classes and by creating new objects. Fixing the identify of new objects during database updates introduces subtle issues into view design. Our presentation, mostly informal, leans on a number of illustrative examples meant to emphasize the simplicity of our mechanism. 1
Monomial orthogonal polynomials of several variables
 DEPARTMENT OF MATHEMATICS UNIVERSITY OF OREGON EUGENE, OREGON
, 2002
"... A monomial orthogonal polynomial of several variables is of the form x Q (x) for a multiindex 2 N 0 and it has the least L P (x), where P and Q are polynomials of degree less than the total degree of x . We study monomial orthogonal polynomials with respect to the weight function 2 i on ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
A monomial orthogonal polynomial of several variables is of the form x Q (x) for a multiindex 2 N 0 and it has the least L P (x), where P and Q are polynomials of degree less than the total degree of x . We study monomial orthogonal polynomials with respect to the weight function 2 i
Extracting paraphrases from a parallel corpus
 In Proc. of the ACL/EACL
, 2001
"... While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of th ..."
Abstract

Cited by 252 (6 self)
 Add to MetaCart
While paraphrasing is critical both for interpretation and generation of natural language, current systems use manual or semiautomatic methods to collect paraphrases. We present an unsupervised learning algorithm for identification of paraphrases from a corpus of multiple English translations of the same source text. Our approach yields phrasal and single word lexical paraphrases as well as syntactic paraphrases. 1
Monomial ideals and planar graphs
 APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERRORCORRECTING CODES, VOLUME 1719 OF SPRINGER LECTURE NOTES IN COMPUTER SCIENCE
, 1999
"... Gröbner basis theory reduces questions about systems of polynomial equations to the combinatorial study of monomial ideals, or staircases. This article gives an elementary introduction to current research in this area. After reviewing the bivariate case, a new correspondence is established between ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
between planar graphs and minimal resolutions of monomial ideals in three variables. A brief guide is given to the literature on complexity issues and monomial ideals in four or more variables.
Results 1  10
of
1,894,512