Sciweavers

377 search results - page 32 / 76
» A Fast Heuristic Algorithm for a Probe Mapping Problem
Sort
View
VLDB
1997
ACM
142views Database» more  VLDB 1997»
14 years 25 days ago
Algorithms for Materialized View Design in Data Warehousing Environment
Selecting views to materialize is one of the most important decisions in designing a data warehouse. In this paper, we present a framework for analyzing the issues in selecting vi...
Jian Yang, Kamalakar Karlapalem, Qing Li
ADBIS
2006
Springer
165views Database» more  ADBIS 2006»
14 years 13 days ago
Fragmenting XML Documents via Structural Constraints
Abstract. XML query processors suffer from main-memory limitations that prevent them from processing large XML documents. While content-based predicates can be used to project down...
Angela Bonifati, Alfredo Cuzzocrea, Bruno Zinno
EVOW
2003
Springer
14 years 1 months ago
GAME-HDL: Implementation of Evolutionary Algorithms Using Hardware Description Languages
Evolutionary Algorithms (EAs) have been proposed as a very powerful heuristic optimization technique to solve complex problems. Many case studies have shown that they work very eff...
Rolf Drechsler, Nicole Drechsler
BMCBI
2008
136views more  BMCBI 2008»
13 years 8 months ago
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Background: Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utili...
Wah-Heng Lee, Christopher W. Wong, Wan Yee Leong, ...
BMCBI
2010
86views more  BMCBI 2010»
13 years 8 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King