Sciweavers

4313 search results - page 863 / 863
» Using time travel to diagnose computer problems
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 10 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
BMCBI
2008
129views more  BMCBI 2008»
13 years 5 months ago
Motif-directed network component analysis for regulatory network inference
Background: Network Component Analysis (NCA) has shown its effectiveness in discovering regulators and inferring transcription factor activities (TFAs) when both microarray data a...
Chen Wang, Jianhua Xuan, Li Chen, Po Zhao, Yue Wan...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 7 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo