3946 search results - page 274 / 790 » The computational complexity of choice sets |
206
click to vote
HRI
2009
ACM
15 years 4 months ago
2009
ACM
This article reports on a user study conducted to asses the credibility of a humanoid robot. The study set-up was based on the "Monty Hall Problem". Overall 13 people be...
186
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Supervoxel segmentation has strong potential to be incorporated into early video analysis as superpixel segmentation has in image analysis. However, there are many plausible super...
179
click to vote
AAAI
2008
15 years 9 months ago
2008
The surprisingly good performance of modern satisfiability (SAT) solvers is usually explained by the existence of a certain "hidden structure" in real-world instances. W...
174
click to vote
COMPGEOM
2006
ACM
16 years 21 days ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
204
click to vote
JMLR
2012
13 years 9 months ago
2012
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...