Sciweavers

29082 search results - page 303 / 5817
» The Time-Triggered Model of Computation
Sort
View
RECOMB
2008
Springer
16 years 7 months ago
On Computing the Breakpoint Reuse Rate in Rearrangement Scenarios
In the past years, many combinatorial arguments have been made to support the theory that mammalian genome rearrangement scenarios rely heavily on breakpoint reuse. Different model...
Anne Bergeron, Julia Mixtacki, Jens Stoye
DCC
2005
IEEE
16 years 6 months ago
Coding the Wavelet Spatial Orientation Tree with Low Computational Complexity
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
Yushin Cho, Amir Said, William A. Pearlman
ICRA
2008
IEEE
164views Robotics» more  ICRA 2008»
16 years 1 months ago
Central axis approach for computing n-finger force-closure grasps
— In this paper, we propose a new approach for computing force-closure grasps of two-dimensional and threedimensional objects. Assuming n hard-finger contact with Coulomb fricti...
Belkacem Bounab, Daniel Sidobre, Abdelouhab Zaatri
METRICS
2005
IEEE
16 years 7 days ago
Measuring Productivity on High Performance Computers
In the high performance computing domain, the speed of execution of a program has typically been the primary performance metric. But productivity is also of concern to high perfor...
Marvin V. Zelkowitz, Victor R. Basili, Sima Asgari...
EURONGI
2005
Springer
16 years 5 days ago
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cell...
Maria José Doménech-Benlloch, Jos&ea...