45 search results - page 9 / 9 » Discovering All Most Specific Sentences by Randomized Algori... |
MOBIHOC
2009
ACM
14 years 10 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
BMCBI
2007
13 years 10 months ago
2007
Background: Cis-acting transcriptional regulatory elements in mammalian genomes typically contain specific combinations of binding sites for various transcription factors. Althoug...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
BMCBI
2010
13 years 4 months ago
2010
Background: The brightness of the probe spots on expression microarrays intends to measure the abundance of specific mRNA targets. Probes with runs of at least three guanines (G) ...
EDBT
2006
ACM
14 years 10 months ago
2006
ACM
Recent years have seen growing interest in effective algorithms for summarizing and querying massive, high-speed data streams. Randomized sketch synopses provide accurate approxima...