Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
133
CONSTRUCTIONS FOR CYCLIC STEINER 2-DESIGNS
"... This paper surveys direct and recursive constructions for cyclic Steiner 2-designs. A new method is presented for cyclic designs with blocks having a prime number of elements. Several new constructions are given for designs with block size 4 which are based on perfect systems of difference sets and ..."
Abstract
- Add to MetaCart
This paper surveys direct and recursive constructions for cyclic Steiner 2-designs. A new method is presented for cyclic designs with blocks having a prime number of elements. Several new constructions are given for designs with block size 4 which are based on perfect systems of difference sets
Picking Alignments from (Steiner) Trees
"... The application of Needleman-Wunsch alignment techniques t,o biological sequences is complicated by two serious prob-lems when t,he sequences are long: the running time, which scales as the product of t,he lc~~gt,hs of sequeucvs, and the tlif-ficult,,y in obtaiuing suitable parameters that produce m ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
advantage of their associated features. Our approach leads to an optimization problem, for which we obtain a 2-approximation algorithm, and that is based on the construction of Manhattan networks, which are close relat.ives of Steiner trees. We describe the underlying theory and show how our methods can
Indicators for Social and Economic Coping Capacity - Moving Toward a Working Definition of Adaptive Capacity”, Wesleyan-CMU Working Paper.
, 2001
"... Abstract This paper offers a practically motivated method for evaluating systems' abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing attention directly on the u ..."
Abstract
-
Cited by 109 (14 self)
- Add to MetaCart
the relative vulnerabilities of diverse systems to multiple stresses and to their potential interactions. It is designed, as well, to help practitioners distinguish productively between macro and micro scale factors that work to define the underlying determinants of coping capacity -a distinction that can
Generalization of the . . . the One-Sided Block Jacobi SVD Algorithm: II. Implementation
, 2008
"... We have designed, implemented and tested (by simulation on a serial computer) the new dynamic ordering for the parallel one-sided block-Jacobi SVD algorithm. Our idea is based on the estimation of the cosines of principal angles between two block columns X and Y of the same width without explicitly ..."
Abstract
- Add to MetaCart
forming the matrix product X T Y (or Y T X) and computing its SVD. Instead, we propose to use a fixed number 2q of iterations in the Lanczos algorithm applied to the symmetric 2x2 block Jordan-Wielandt matrix with zero diagonal blocks, 21-block X T Y and 12-block Y T X; the order of the Jordan
ii List of Publications
, 2014
"... pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios ..."
Abstract
- Add to MetaCart
pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios
Scenario Generation and Reduction for Long-term and Short-term Power System Generation Planning under Uncertainties
"... ii ..."
( de Gruyter 2002 New prolific constructions of strongly regular graphs
"... Abstract. We present a purely combinatorial construction of strongly regular graphs with geometric parameters. The construction produces hyperexponentially many graphs, and uses neither linear algebra nor groups. Among the graphs constructed, there are graphs with pa-rameters of a generalized quadra ..."
Abstract
- Add to MetaCart
, distance regular graphs of diameter 3 with the trivial group of automorphisms. As building blocks of the construction we shall use certain 2-designs: resolvable de-signs with constant intersection of non-parallel lines. In this paper we shall call them a‰ne designs. Definition 1. An a‰ne design is a 2
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN. VOL. II, NO. 6 JUNE 1992 739 Provably Good Performance-Driven Global Routing
- IEEE Trans. on CAD
, 1992
"... We propose a provably good performance-driven global routing algorithm for both cell-based and building-block design. The approach is based on a new bounded-radius minimum routing tree formulation. We first present several heuristics with good performance, based on an analog of Prim's minimum s ..."
Abstract
- Add to MetaCart
, we can construct a routing tree with longest interconnection path length at most (1 + ) - R, and with cost at most (1 + (2/0) times the minimum spanning tree weight. Moreover, for Steiner global routing in arbitrary weighted graphs, we achieve longest path length at most (1 + ) . R, with wiring cost
Designing Floating codes for . . .
"... Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, with each cell in one of q states {0,1,...,q − 1}. The cells are used to represent k variable values from an ℓ-ary alpha ..."
Abstract
- Add to MetaCart
Floating codes are codes designed to store multiple values in a Write Asymmetric Memory, with applications to flash memory. In this model, a memory consists of a block of n cells, with each cell in one of q states {0,1,...,q − 1}. The cells are used to represent k variable values from an ℓ
Results 1 - 10
of
133
