Sciweavers

288 search results - page 52 / 58
» Notes on computing minimal approximant bases
Sort
View
CF
2010
ACM
14 years 2 months ago
Interval-based models for run-time DVFS orchestration in superscalar processors
We develop two simple interval-based models for dynamic superscalar processors. These models allow us to: i) predict with great accuracy performance and power consumption under va...
Georgios Keramidas, Vasileios Spiliopoulos, Stefan...
BMCBI
2010
160views more  BMCBI 2010»
13 years 4 months ago
eHive: An Artificial Intelligence workflow system for genomic analysis
Background: The Ensembl project produces updates to its comparative genomics resources with each of its several releases per year. During each release cycle approximately two week...
Jessica Severin, Kathryn Beal, Albert J. Vilella, ...
ICPR
2008
IEEE
14 years 11 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
ICCV
2007
IEEE
13 years 11 months ago
Ten-fold Improvement in Visual Odometry Using Landmark Matching
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...
Zhiwei Zhu, Taragay Oskiper, Supun Samarasekera, R...
JPDC
2006
141views more  JPDC 2006»
13 years 9 months ago
M-TREE: A high efficiency security architecture for protecting integrity and privacy of software
Secure processor architectures enable new sets of applications such as commercial grid computing, software copy protection and secure mobile agents by providing secure computing e...
Chenghuai Lu, Tao Zhang, Weidong Shi, Hsien-Hsin S...