Sciweavers

89222 search results - page 17839 / 17845
» Which
Sort
View
CCR
2005
103views more  CCR 2005»
13 years 7 months ago
Part III: routers with very small buffers
Internet routers require buffers to hold packets during times of congestion. The buffers need to be fast, and so ideally they should be small enough to use fast memory technologie...
Mihaela Enachescu, Yashar Ganjali, Ashish Goel, Ni...
BMCBI
2004
174views more  BMCBI 2004»
13 years 7 months ago
SeeGH - A software tool for visualization of whole genome array comparative genomic hybridization data
Background: Array comparative genomic hybridization (CGH) is a technique which detects copy number differences in DNA segments. Complete sequencing of the human genome and the dev...
Bryan Chi, Ronald J. deLeeuw, Bradley P. Coe, Calu...
ECCC
2007
147views more  ECCC 2007»
13 years 7 months ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
MLQ
2000
99views more  MLQ 2000»
13 years 7 months ago
Von Rimscha's Transitivity Conditions
In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to "Every set has the s...
Paul E. Howard, Jean E. Rubin, Adrienne Stanley
ADCM
1998
132views more  ADCM 1998»
13 years 7 months ago
Numerical solution of generalized Lyapunov equations
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
Thilo Penzl
« Prev « First page 17839 / 17845 Last » Next »