نتایج جستجو برای: mapped finite
تعداد نتایج: 296543 فیلتر نتایج به سال:
MOTIVATION The next generation sequencing technologies are generating billions of short reads daily. Resequencing and personalized medicine need much faster software to map these deep sequencing reads to a reference genome, to identify SNPs or rare transcripts. RESULTS We present a framework for how full sensitivity mapping can be done in the most efficient way, via spaced seeds. Using the fr...
The constrained migration problem arises in the memory management of large multiprocessor systems. Given a network of processors, each of which has its own local memory, the purpose of this problem is to nd an e cient migration strategy which locates each writable page at an appropriate processor by migration to reduce the total access cost, while considering the actual capacity of each local m...
Lutz Wegner, Manfred Paul, Jens Thamm, and Sven Thelemann FB Mathematik/Informatik Universit at Gesamthochschule Kassel D-34109 Kassel, Germany fwegner, mpaul, injt, [email protected] Abstract Pointer Swizzling has been recognized as an e cient persistent storage concept for object stores. Here, we show how the classical Record (Tuple) Identi ers (RID, TID) scheme can be combi...
Finite element methods for symmetric linear hyperbolic systems using unstructured advancing fronts (satisfying a causality condition) are considered in this work. Convergence results and error bounds obtained mapped tent pitching schemes made with standard discontinuous Galerkin discretizations spatial approximation on tents. Techniques to study semidiscretization tents, design fully discrete s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید