Sciweavers

74 search results - page 15 / 15
» A note on the size of minimal covers
Sort
View
IROS
2009
IEEE
214views Robotics» more  IROS 2009»
14 years 4 days 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, ...
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 3 days 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
ICCAD
1999
IEEE
81views Hardware» more  ICCAD 1999»
13 years 9 months ago
Modeling design constraints and biasing in simulation using BDDs
Constraining and input biasing are frequently used techniques in functional verification methodologies based on randomized simulation generation. Constraints confine the simulatio...
Jun Yuan, Kurt Shultz, Carl Pixley, Hillel Miller,...
HPCA
2011
IEEE
12 years 9 months ago
Archipelago: A polymorphic cache design for enabling robust near-threshold operation
Extreme technology integration in the sub-micron regime comes with a rapid rise in heat dissipation and power density for modern processors. Dynamic voltage scaling is a widely us...
Amin Ansari, Shuguang Feng, Shantanu Gupta, Scott ...