Sciweavers

1658 search results - page 249 / 332
» Implementing Bit-addressing with Specialization
Sort
View
ANOR
2007
80views more  ANOR 2007»
13 years 10 months ago
The minimum shift design problem
The min-SHIFT DESIGN problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the...
Luca Di Gaspero, Johannes Gärtner, Guy Kortsa...
CGF
2008
217views more  CGF 2008»
13 years 10 months ago
A Flexible Kernel for Adaptive Mesh Refinement on GPU
We present a flexible GPU kernel for adaptive on-the-fly refinement of meshes with arbitrary topology. By simply reserving a small amount of GPU memory to store a set of adaptive ...
Tamy Boubekeur, Christophe Schlick
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 10 months ago
XPath Whole Query Optimization
Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown tha...
Sebastian Maneth, Kim Nguyen
CONCURRENCY
2008
83views more  CONCURRENCY 2008»
13 years 10 months ago
A definition of and linguistic support for partial quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 10 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen