Sciweavers

466 search results - page 75 / 94
» Preprocessing Search Spaces for Branch and Bound Search
Sort
View
DAC
2004
ACM
15 years 9 months ago
Implicit pseudo boolean enumeration algorithms for input vector control
In a CMOS combinational logic circuit, the subthreshold leakage current in the standby state depends on the state of the inputs. In this paper we present a new approach to identif...
Kaviraj Chopra, Sarma B. K. Vrudhula
ICASSP
2010
IEEE
15 years 4 months ago
An alternative scanning strategy to detect faces
The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the gri...
Venkatesh Bala Subburaman, Sébastien Marcel
COMPGEOM
2009
ACM
16 years 15 days ago
A general approach for cache-oblivious range reporting and approximate range counting
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 9 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
ICML
2002
IEEE
16 years 6 months ago
Learning from Scarce Experience
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...
Leonid Peshkin, Christian R. Shelton