Sciweavers

440 search results - page 85 / 88
» Multiple Comparisons in Induction Algorithms
Sort
View
IMSCCS
2006
IEEE
14 years 1 months ago
Combining Comparative Genomics with de novo Motif Discovery to Identify Human Transcription Factor DNA-Binding Motifs
Background: As more and more genomes are sequenced, comparative genomics approaches provide a methodology for identifying conserved regulatory elements that may be involved in gen...
Linyong Mao, W. Jim Zheng
SIGMOD
1999
ACM
108views Database» more  SIGMOD 1999»
13 years 11 months ago
DynaMat: A Dynamic View Management System for Data Warehouses
Pre-computation and materialization of views with aggregate functions is a common technique in Data Warehouses. Due to the complex structure of the warehouse and the different pro...
Yannis Kotidis, Nick Roussopoulos
TON
2010
163views more  TON 2010»
13 years 5 months ago
Toward practical opportunistic routing with intra-session network coding for mesh networks
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
Bozidar Radunovic, Christos Gkantsidis, Peter B. K...
DAC
2002
ACM
14 years 8 months ago
Design of a high-throughput low-power IS95 Viterbi decoder
The design of high-throughput large-state Viterbi decoders relies on the use of multiple arithmetic units. The global communication channels among these parallel processors often ...
Xun Liu, Marios C. Papaefthymiou
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
14 years 2 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...