Sciweavers

3864 search results - page 440 / 773
» time 2005
Sort
View
RECOMB
2005
Springer
16 years 7 months ago
Rapid Protein Side-Chain Packing via Tree Decomposition
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
Jinbo Xu
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 7 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
ICCAD
2006
IEEE
152views Hardware» more  ICCAD 2006»
16 years 3 months ago
Fast and robust quadratic placement combined with an exact linear net model
— This paper presents a robust quadratic placement approach, which offers both high-quality placements and excellent computational efficiency. The additional force which distrib...
Peter Spindler, Frank M. Johannes
SACI
2007
IEEE
16 years 1 months ago
Geometric Theory and Control of Linear Parameter Varying Systems
: Linear Parameter Varying(LPV) systems appear in a form of LTI state space representations where the elements of the A(ρ), B(ρ), C(ρ) matrices can depend on an unknown but at a...
Jozsef Bokor
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
16 years 13 days ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci