Sciweavers

2104 search results - page 195 / 421
» Sorting with networks of data structures
Sort
View
154
Voted
BMCBI
2010
189views more  BMCBI 2010»
15 years 5 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,...
ICFEM
2009
Springer
15 years 2 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
DATE
2000
IEEE
140views Hardware» more  DATE 2000»
15 years 9 months ago
Resolution of Dynamic Memory Allocation and Pointers for the Behavioral Synthesis from C
-- One of the greatest challenges in C/C++-based design methodology is to efficiently map C/C++ models into hardware. Many of the networking and multimedia applications implemente...
Luc Séméria, Koichi Sato, Giovanni D...
166
Voted
HICSS
2005
IEEE
172views Biometrics» more  HICSS 2005»
15 years 10 months ago
A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks
Abstract— In this paper we propose a novel location management scheme tailored for multicasting in Mobile Ad-hoc Networks (MANETs). We furthermore propose AMDLM, a locationbased ...
Yoav Sasson, David Cavin, André Schiper
116
Voted
DSRT
1998
IEEE
15 years 9 months ago
A Network Architecture for Remote Rendering
Internet-based virtual environments (VEs) let users explore multiple virtual worlds with many different geometric models which are downloaded rather than predistributed. To avoid ...
Gerd Hesina, Dieter Schmalstieg