Sciweavers

3927 search results - page 116 / 786
» Dynamic Dependencies and Performance Improvement
Sort
View
CASES
2005
ACM
15 years 8 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
FGIT
2010
Springer
15 years 4 months ago
Improved Location Aided Cluster Based Routing Protocol for GPS Enabled Manets
Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints. Completely GPS free as well as GPS scarce positioning systems for ...
S. Mangai, A. Tamilarasi
EDBT
2000
ACM
15 years 10 months ago
Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
Caetano Traina Jr., Agma J. M. Traina, Bernhard Se...
BMCBI
2005
114views more  BMCBI 2005»
15 years 6 months ago
A new decoding algorithm for hidden Markov models improves the prediction of the topology of all-beta membrane proteins
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
Piero Fariselli, Pier Luigi Martelli, Rita Casadio
ICRA
2003
IEEE
147views Robotics» more  ICRA 2003»
15 years 11 months ago
Design and control of a novel 4-DOFs parallel robot H4
This paper deals with the design and dynamic control simulation of a new type of 4-DOFs parallel mechanism providing 3 translations and 1 rotation for highspeed handling and machi...
H. B. Choi, Olivier Company, François Pierr...