360 search results - page 32 / 72 » Dynamic Sample Selection for Approximate Query Processing |
PR
2006
14 years 11 months ago
2006
In many pattern recognition applications, high-dimensional feature vectors impose a high computational cost as well as the risk of "overfitting". Feature Selection addre...
127
click to vote
RSS
2007
15 years 1 months ago
2007
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
181
click to vote
ICDE
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
133
click to vote
GECCO
2010
Springer
15 years 4 months ago
2010
Springer
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
121
click to vote
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...