Sciweavers

3020 search results - page 166 / 604
» Optimal partition trees
Sort
View
EURODAC
1995
IEEE
116views VHDL» more  EURODAC 1995»
15 years 10 months ago
An improved relaxation approach for mixed system analysis with several simulation tools
: This paper introduces a modified relaxation approach that allows to improve the convergence of iterations while analyzing mixed systems with different simulators. The method redu...
Vladimir B. Dmitriev-Zdorov, Bernhard Klaassen
COLOGNETWENTE
2010
15 years 5 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
IPPS
2006
IEEE
16 years 16 days ago
Parallel multiple sequence alignment with local phylogeny search by simulated annealing
The problem of multiple sequence alignment is one of the most important problems in computational biology. In this paper we present a new method that simultaneously performs multi...
Jaroslaw Zola, Denis Trystram, Andrei Tchernykh, C...
DISOPT
2006
90views more  DISOPT 2006»
15 years 6 months ago
Tree decompositions of graphs: Saving memory in dynamic programming
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann
EGPGV
2004
Springer
181views Visualization» more  EGPGV 2004»
15 years 12 months ago
Parallel Multiresolution Volume Rendering of Large Data Sets with Error-Guided Load Balancing
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
Chaoli Wang, Jinzhu Gao, Han-Wei Shen