Sciweavers

4342 search results - page 196 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
142
Voted
CORR
2008
Springer
150views Education» more  CORR 2008»
15 years 5 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica
LCTRTS
2009
Springer
15 years 11 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr
APPROX
2009
Springer
96views Algorithms» more  APPROX 2009»
15 years 11 months ago
On the Optimality of Gluing over Scales
We show that for every α > 0, there exist n-point metric spaces (X, d) where every “scale” admits a Euclidean embedding with distortion at most α, but the whole space req...
Alexander Jaffe, James R. Lee, Mohammad Moharrami
ICCMS
2009
118views more  ICCMS 2009»
15 years 2 months ago
Optimized Parallel Implementation of Gillespie's First Reaction Method on Graphics Processing Units
The simulation of chemical reacting systems is one of the most challenging topics in Systems Biology, due to their complexity and inherent randomness. The Gillespie's Stochas...
Cristian Dittamo, Davide Cangelosi
BMCBI
2007
145views more  BMCBI 2007»
15 years 4 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...