Sciweavers

429 search results - page 3 / 86
» Permutative Additives and Exponentials
Sort
View
COMBINATORICS
2006
133views more  COMBINATORICS 2006»
13 years 7 months ago
Completion of the Wilf-Classification of 3-5 Pairs Using Generating Trees
A permutation is said to avoid the permutation if no subsequence in has the same order relations as . Two sets of permutations 1 and 2 are Wilfequivalent if, for all n, the numb...
Mark Lipson
DAM
2006
120views more  DAM 2006»
13 years 7 months ago
A bijection between permutations and floorplans, and its applications
A floorplan represents the relative relations between modules on an integrated circuit. Floorplans are commonly classified as slicing, mosaic, or general. Separable and Baxter per...
Eyal Ackerman, Gill Barequet, Ron Y. Pinter
TEC
2008
93views more  TEC 2008»
13 years 7 months ago
An Artificial Immune System Heuristic for Generating Short Addition Chains
This paper deals with the optimal computation of finite field exponentiation, which is a well-studied problem with many important applications in the areas of error-correcting code...
Nareli Cruz Cortés, Francisco Rodríg...
DM
1999
122views more  DM 1999»
13 years 7 months ago
Parking functions, valet functions and priority queues
We construct a bijection between labeled trees and allowable pairs of permutations sorted by a priority queue. These are also the pairs of permutations that avoid the pattern pairs...
Julian D. Gilbey, Louis H. Kalikow
CSDA
2006
145views more  CSDA 2006»
13 years 7 months ago
Improved predictions penalizing both slope and curvature in additive models
A new method is proposed to estimate the nonlinear functions in an additive regression model. Usually, these functions are estimated by penalized least squares, penalizing the cur...
Magne Aldrin