Sciweavers

3545 search results - page 564 / 709
» Computational methods for case-cohort studies
Sort
View
BMCBI
2005
104views more  BMCBI 2005»
15 years 6 months ago
Scoring functions for transcription factor binding site prediction
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
Markus T. Friberg, Peter von Rohr, Gaston H. Gonne...
TVLSI
2002
97views more  TVLSI 2002»
15 years 6 months ago
Techniques for energy-efficient communication pipeline design
The performance of many modern computer and communication systems is dictated by the latency of communication pipelines. At the same time, power/energy consumption is often another...
Gang Qu, Miodrag Potkonjak
WABI
2010
Springer
170views Bioinformatics» more  WABI 2010»
15 years 4 months ago
Haplotypes versus Genotypes on Pedigrees
Abstract. Genome sequencing will soon produce haplotype data for individuals. For pedigrees of related individuals, sequencing appears to be an attractive alternative to genotyping...
Bonnie Kirkpatrick
IPPS
2010
IEEE
15 years 4 months ago
Stability of a localized and greedy routing algorithm
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
Christelle Caillouet, Florian Huc, Nicolas Nisse, ...
DIMACS
1996
15 years 7 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin