213 search results - page 27 / 43 » An Approximation Algorithm for Binary Searching in Trees |
JMLR
2010
14 years 6 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
103
click to vote
HICSS
2008
IEEE
15 years 6 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
223
click to vote
GIS
2004
ACM
16 years 23 days ago
2004
ACM
This paper presents a fast algorithm for smooth digital elevation model interpolation and approximation from scattered elevation data. The global surface is reconstructed by subdi...
CVPR
1998
IEEE
16 years 1 months ago
1998
IEEE
A method is presented for e cient and reliable object recognition within noisy, cluttered, and occluded range images. The method is based on a strategy which hypothesizes the inte...
ICML
2010
IEEE
15 years 24 days ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...