1192 search results - page 96 / 239 » Computing Weakest Readings |
149
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
115
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: Ornithine decarboxylase antizymes are proteins which negatively regulate cellular polyamine levels via their affects on polyamine synthesis and cellular uptake. In vir...
192
Voted
HUC
2011
Springer
14 years 3 months ago
2011
Springer
Interactive surfaces like diffuse illumination tabletops (DIT) identify and track objects using multiple techniques like shape and color recognition, fiducial markers, electronic...
165
Voted
PLDI
1991
ACM
15 years 7 months ago
1991
ACM
o Authors of Extended Abstracts William Pugh Dept. of Computer Science and Institute for Advanced Computer Studies Univ. of Maryland, College Park March 16, 1993 This article stems...
239
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
In a massive stream of sequential events such as stock feeds, sensor readings, or IP traffic measurements, tuples pertaining to recent events are typically more important than olde...