Sciweavers

628 search results - page 51 / 126
» The minimum shift design problem
Sort
View
105
Voted
DAC
1999
ACM
15 years 5 months ago
Exact Memory Size Estimation for Array Computations without Loop Unrolling
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
Ying Zhao, Sharad Malik
99
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Analyzing Nonblocking Switching Networks using Linear Programming (Duality)
Abstract—The main task in analyzing a switching network design (including circuit-, multirate-, and photonic-switching) is to determine the minimum number of some switching compo...
Hung Q. Ngo, Atri Rudra, Anh N. Le, Thanh-Nhan Ngu...
121
Voted
BMCBI
2007
109views more  BMCBI 2007»
15 years 25 days ago
Computational RNA secondary structure design: empirical complexity and improved methods
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
Rosalía Aguirre-Hernández, Holger H....
115
Voted
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
15 years 2 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
PRIB
2009
Springer
147views Bioinformatics» more  PRIB 2009»
15 years 7 months ago
Cross-Platform Analysis with Binarized Gene Expression Data
Abstract. With widespread use of microarray technology as a potential diagnostics tool, the comparison of results obtained from the use of different platforms is of interest. When...
Salih Tuna, Mahesan Niranjan