Sciweavers

2313 search results - page 339 / 463
» On Heuristic Time Hierarchies
Sort
View
PDPTA
2004
15 years 7 months ago
Efficient Disk Replacement and Data Migration Algorithms for Large Disk Subsystems
Random data placement has recently emerged as an alternative to traditional data striping. From a performance perspective, it has been demonstrated to be an efficient and scalable...
Roger Zimmermann, Beomjoo Seo
BMCBI
2006
239views more  BMCBI 2006»
15 years 6 months ago
Applying dynamic Bayesian networks to perturbed gene expression data
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek...
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 6 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
PVLDB
2008
126views more  PVLDB 2008»
15 years 5 months ago
Parallelizing query optimization
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...
Wook-Shin Han, Wooseong Kwak, Jinsoo Lee, Guy M. L...
JCO
2011
115views more  JCO 2011»
15 years 1 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu