Sciweavers

7200 search results - page 1427 / 1440
» On the Computational Power of Winner-Take-All
Sort
View
BMCBI
2005
152views more  BMCBI 2005»
13 years 8 months ago
Improved profile HMM performance by assessment of critical algorithmic features in SAM and HMMER
Background: Profile hidden Markov model (HMM) techniques are among the most powerful methods for protein homology detection. Yet, the critical features for successful modelling ar...
Markus Wistrand, Erik L. L. Sonnhammer
JCM
2007
131views more  JCM 2007»
13 years 8 months ago
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
Fadi A. Aloul, Bashar Al Rawi, Mokhtar Aboelaze
JCP
2007
121views more  JCP 2007»
13 years 8 months ago
p-Trust: A New Model of Trust to Allow Finer Control Over Privacy in Peer-to-Peer Framework
— Every time a user conducts an electronic transaction over the Internet a wealth of personal information is revealed, either voluntarily or involuntarily. This causes serious br...
Sudip Chakraborty, Indrajit Ray
TON
2008
124views more  TON 2008»
13 years 8 months ago
Designing packet buffers for router linecards
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...
Sundar Iyer, Ramana Rao Kompella, Nick McKeown
TPDS
2008
157views more  TPDS 2008»
13 years 8 months ago
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks
The localization of sensor nodes is a fundamental problem in sensor networks and can be implemented using powerful and expensive beacons. Beacons, the fewer the better, can acquire...
Bin Xiao, Hekang Chen, Shuigeng Zhou
« Prev « First page 1427 / 1440 Last » Next »