Sciweavers

7773 search results - page 72 / 1555
» On generalized Frame-Stewart numbers
Sort
View
SODA
2003
ACM
138views Algorithms» more  SODA 2003»
13 years 10 months ago
Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
Hung Q. Ngo, Van H. Vu
EGH
2010
Springer
13 years 7 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
ARSCOM
2005
61views more  ARSCOM 2005»
13 years 9 months ago
On multi-avoidance of generalized patterns
In [Kit1] Kitaev discussed simultaneous avoidance of two 3-patterns with no internal dashes, that is, where the patterns correspond to contiguous subwords in a permutation. In thre...
Sergey Kitaev, Toufik Mansour
BMCBI
2007
180views more  BMCBI 2007»
13 years 9 months ago
Using expression arrays for copy number detection: an example from E. coli
Background: The sequencing of many genomes and tiling arrays consisting of millions of DNA segments spanning entire genomes have made high-resolution copy number analysis possible...
Dmitriy Skvortsov, Diana Abdueva, Michael E. Stitz...
TYPES
2000
Springer
14 years 16 days ago
A Tour with Constructive Real Numbers
Abstract. The aim of this work is to characterize constructive real numbers through a minimal axiomatization. We introduce, discuss and justify 16 constructive axioms. Then we addr...
Alberto Ciaffaglione, Pietro Di Gianantonio