Sciweavers

692 search results - page 83 / 139
» BDD minimization for approximate computing
Sort
View
IJCV
2006
142views more  IJCV 2006»
14 years 11 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...
IJRR
2007
60views more  IJRR 2007»
14 years 11 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
VLSID
2005
IEEE
89views VLSI» more  VLSID 2005»
15 years 11 months ago
Power Optimization in Current Mode Circuits
We propose a method to minimize power dissipation in current-mode CMOS analog and multiple-valued logic (MVL) circuits employing a stack of current comparators. First, we present ...
M. S. Bhat, H. S. Jamadagni
FSTTCS
2009
Springer
15 years 5 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...
COMPSAC
2008
IEEE
15 years 5 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit