Sciweavers

1497 search results - page 295 / 300
» A Computational Model for Message Passing
Sort
View
ISORC
2000
IEEE
14 years 7 days ago
A Vision of the Future for the Air Force (and Perhaps the Whole DoD)
The Air Force has enthusiastically endorsed, at its most senior levels, advanced thinking with regard to the application of information technology. Recently, the notion of a Joint...
Thomas F. Saunders
ICS
1999
Tsinghua U.
14 years 3 days ago
Fast cluster failover using virtual memory-mapped communication
This paper proposes a novel way to use virtual memorymapped communication (VMMC) to reduce the failover time on clusters. With the VMMC model, applications’ virtual address spac...
Yuanyuan Zhou, Peter M. Chen, Kai Li
WG
1998
Springer
14 years 1 days ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
CSE
2009
IEEE
13 years 9 months ago
Time Critical Content Delivery Using Predictable Patterns in Mobile Social Networks
In Mobile Social Networks (MSN) individuals with similar interests or commonalities connect to each other using the mobile phones. MSN are special kind of Ad-hoc Networks in which ...
Fawad Nazir, Jianhua Ma, Aruna Seneviratne
BMCBI
2010
189views more  BMCBI 2010»
13 years 8 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...