Sciweavers

154 search results - page 23 / 31
» Near Best Tree Approximation
Sort
View
ISCA
2002
IEEE
108views Hardware» more  ISCA 2002»
14 years 14 days ago
The Optimal Logic Depth Per Pipeline Stage is 6 to 8 FO4 Inverter Delays
Microprocessor clock frequency has improved by nearly 40% annually over the past decade. This improvement has been provided, in equal measure, by smaller technologies and deeper p...
M. S. Hrishikesh, Doug Burger, Stephen W. Keckler,...
SARA
2009
Springer
14 years 2 days ago
Light Algorithms for Maintaining Max-RPC During Search
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
Julien Vion, Romuald Debruyne
DAGM
1997
Springer
13 years 11 months ago
A Feature Map Approach to Real-Time 3-D Object Pose Estimation from Single 2-D Perspective Views
A novel approach to the computation of an approximate estimate of spatial object pose from camera images is proposed. The method is based on a neural network that generates pose hy...
S. Winkler, Patrick Wunsch, Gerd Hirzinger
ESA
2011
Springer
260views Algorithms» more  ESA 2011»
12 years 7 months ago
On Variants of the Matroid Secretary Problem
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
Shayan Oveis Gharan, Jan Vondrák
SIAMCOMP
2002
142views more  SIAMCOMP 2002»
13 years 7 months ago
On Binary Searching with Nonuniform Costs
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
Eduardo Sany Laber, Ruy Luiz Milidiú, Artur...