Sciweavers

10051 search results - page 1459 / 2011
» A Dynamic Separator Algorithm
Sort
View
RECOMB
2004
Springer
16 years 6 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
RECOMB
2001
Springer
16 years 6 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
INFOCOM
2009
IEEE
16 years 1 months ago
Keep Cache Replacement Simple in Peer-Assisted VoD Systems
—Peer-assisted Video-on-Demand (VoD) systems have not only received substantial recent research attention, but also been implemented and deployed with success in large-scale real...
Jiahua Wu, Baochun Li
SUTC
2008
IEEE
16 years 25 days ago
Hovering Information - Self-Organising Information that Finds Its Own Storage
A piece of Hovering Information is a geo-localized information residing in a highly dynamic environment such as a mobile ad hoc network. This information is attached to a geograph...
Alfredo A. Villalba Castro, Giovanna Di Marzo Seru...
BROADNETS
2007
IEEE
16 years 24 days ago
Reduced flow routing: Leveraging residual capacity to reduce blocking in GMPLS networks
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
Xiaolan J. Zhang, Sun-il Kim, Steven S. Lumetta
« Prev « First page 1459 / 2011 Last » Next »