Sciweavers

13214 search results - page 2312 / 2643
» Pseudorandomness for network algorithms
Sort
View
BMCBI
2008
123views more  BMCBI 2008»
15 years 7 months ago
Pol II promoter prediction using characteristic 4-mer motifs: a machine learning approach
Background: Eukaryotic promoter prediction using computational analysis techniques is one of the most difficult jobs in computational genomics that is essential for constructing a...
Firoz Anwar, Syed Murtuza Baker, Taskeed Jabid, Md...
CORR
2010
Springer
268views Education» more  CORR 2010»
15 years 6 months ago
Bayesian Based Comment Spam Defending Tool
Spam messes up user's inbox, consumes network resources and spread worms and viruses. Spam is flooding of unsolicited, unwanted e mail. Spam in blogs is called blog spam or c...
Dhinaharan Nagamalai, Beatrice Cynthia Dhinakaran,...
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 6 months ago
Opportunistic Collaborative Beamforming with One-Bit Feedback
An energy-efficient opportunistic collaborative beamformer with one-bit feedback is proposed for ad hoc sensor networks over Rayleigh fading channels. In contrast to conventional c...
Man-On Pun, D. Richard Brown III, H. Vincent Poor
178
Voted
AUTOMATICA
2006
112views more  AUTOMATICA 2006»
15 years 6 months ago
Joint identification of plant rational models and noise distribution functions using binary-valued observations
System identification of plants with binary-valued output observations is of importance in understanding modeling capability and limitations for systems with limited sensor inform...
Le Yi Wang, Gang George Yin, Ji-Feng Zhang
CCR
2006
82views more  CCR 2006»
15 years 6 months ago
Why flow-completion time is the right metric for congestion control
Users typically want their flows to complete as quickly as possible: They want a web-page to download quickly, or a file transfer to complete as rapidly as possible. In other words...
Nandita Dukkipati, Nick McKeown
« Prev « First page 2312 / 2643 Last » Next »