Sciweavers

554 search results - page 92 / 111
» Power Domination Problem in Graphs
Sort
View
BIBM
2010
IEEE
286views Bioinformatics» more  BIBM 2010»
13 years 5 months ago
Evaluation of short read metagenomic assembly
Advances in sequencing technologies have equipped researchers with the ability to sequence the collective genome of entire microbial communities commonly referred to as metagenomi...
Anveshi Charuvaka, Huzefa Rangwala
RTSS
1992
IEEE
13 years 12 months ago
Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
Chao-Ju Hou, Kang G. Shin
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 9 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
ALMOB
2006
138views more  ALMOB 2006»
13 years 7 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
14 years 8 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur