Sciweavers

3946 search results - page 486 / 790
» The computational complexity of choice sets
Sort
View
IJCNN
2007
IEEE
16 years 1 months ago
Optimizing 0/1 Loss for Perceptrons by Random Coordinate Descent
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
Ling Li, Hsuan-Tien Lin
CVPR
2010
IEEE
16 years 29 days ago
Dominant Orientation Templates for Real-Time Detection of Texture-Less Objects
We present a method for real-time 3D object detection that does not require a time consuming training stage, and can handle untextured objects. At its core, is a novel tem- plat...
Stefan Hinterstoisser, Vincent Lepetit, Slobodan I...
CONCUR
2007
Springer
16 years 29 days ago
Strategy Logic
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
GECCO
2007
Springer
185views Optimization» more  GECCO 2007»
16 years 28 days ago
Enhanced forma analysis of permutation problems
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
Tao Gong, Andrew Tuson
3DPVT
2006
IEEE
176views Visualization» more  3DPVT 2006»
16 years 25 days ago
Belief Propagation for Panorama Generation
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...
Alan Brunton, Chang Shu