Sciweavers

570 search results - page 92 / 114
» Partitioned optimization algorithms for multiple sequence al...
Sort
View
BMCBI
2010
218views more  BMCBI 2010»
14 years 9 months ago
Fast multi-core based multimodal registration of 2D cross-sections and 3D datasets
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
Michael Scharfe, Rainer Pielot, Falk Schreiber
68
Voted
FUIN
2008
80views more  FUIN 2008»
14 years 9 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...
WSC
2004
14 years 11 months ago
A New Method to Determine the Tool Count of a Semiconductor Factory Using FabSim
Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact ...
Holger Vogt
CVPR
2004
IEEE
15 years 11 months ago
Shape Correspondence through Landmark Sliding
Motivated by improving statistical shape analysis, this paper presents a novel landmark-based method for accurate shape correspondence, where the general goal is to align multiple...
Song Wang, Toshiro Kubota, Theodor Richardson
EDBT
2008
ACM
135views Database» more  EDBT 2008»
15 years 9 months ago
Minimizing latency and memory in DSMS: a unified approach to quasi-optimal scheduling
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
Yijian Bai, Carlo Zaniolo