Sciweavers

943 search results - page 86 / 189
» How should data structures and algorithms be taught
Sort
View
DBPL
1997
Springer
90views Database» more  DBPL 1997»
15 years 2 months ago
Implementing Incremental View Maintenance in Nested Data Models
Previous research on materialized views has primarily been in the context of flat relational databases--materialized views defined in terms of one or more flat relations. This pape...
Akira Kawaguchi, Daniel F. Lieuwen, Inderpal Singh...
BMCBI
2010
164views more  BMCBI 2010»
14 years 7 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
BMCBI
2011
14 years 1 months ago
Clustering gene expression data with a penalized graph-based metric
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
Ariel E. Bayá, Pablo M. Granitto
GCC
2005
Springer
15 years 3 months ago
Incorporating Data Movement into Grid Task Scheduling
Task Scheduling is a critical design issue of distributed computing. The emerging Grid computing infrastructure consists of heterogeneous resources in widely distributed autonomous...
Xiaoshan He, Xian-He Sun
JCB
2006
129views more  JCB 2006»
14 years 9 months ago
GenRate: A Generative Model that Reveals Novel Transcripts in Genome-Tiling Microarray Data
Genome-wide microarray designs containing millions to hundreds of millions of probes are available for a variety of mammals, including mouse and human. These genome tiling arrays ...
Brendan J. Frey, Quaid Morris, Timothy R. Hughes