Sciweavers

269 search results - page 8 / 54
» Computing the inverse sort transform in linear time
Sort
View
ICMCS
2008
IEEE
336views Multimedia» more  ICMCS 2008»
14 years 1 months ago
SIMD optimization of the H.264/SVC decoder with efficient data structure
H.264/scalable video coding (SVC) is a new compression technique that can adapt to various network environments and applications. However, despite its outstanding performance, H.2...
Joohyun Lee, Gwanggil Jeon, Sangjun Park, Taeyoung...
CSB
2005
IEEE
135views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Inverse Design of Large Molecules using Linear Diophantine Equations
We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
Shawn Martin, W. Michael Brown, Jean-Loup Faulon, ...
RECOMB
2005
Springer
14 years 7 months ago
On Sorting by Translocations
The study of genome rearrangements is an important tool in comparative genomics. This paper revisits the problem of sorting a multichromosomal genome by translocations, i.e. exchan...
Anne Bergeron, Julia Mixtacki, Jens Stoye
STRINGOLOGY
2004
13 years 8 months ago
Sorting suffixes of two-pattern strings
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
Frantisek Franek, William F. Smyth
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
14 years 23 days ago
Super Scalar Sample Sort
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
Peter Sanders, Sebastian Winkel