Sciweavers

653 search results - page 119 / 131
» The size of minimum 3-trees
Sort
View
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
15 years 4 months ago
1-point RANSAC for EKF-based Structure from Motion
Abstract— Recently, classical pairwise Structure From Motion (SfM) techniques have been combined with non-linear global optimization (Bundle Adjustment, BA) over a sliding window...
Javier Civera, Oscar G. Grasa, Andrew J. Davison, ...
MICRO
2009
IEEE
178views Hardware» more  MICRO 2009»
15 years 4 months ago
Improving cache lifetime reliability at ultra-low voltages
Voltage scaling is one of the most effective mechanisms to reduce microprocessor power consumption. However, the increased severity of manufacturing-induced parameter variations a...
Zeshan Chishti, Alaa R. Alameldeen, Chris Wilkerso...
91
Voted
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
15 years 4 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
15 years 4 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ASPDAC
2009
ACM
152views Hardware» more  ASPDAC 2009»
15 years 4 months ago
A novel Toffoli network synthesis algorithm for reversible logic
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
Yexin Zheng, Chao Huang