Sciweavers

1578 search results - page 271 / 316
» Algorithmic randomness of continuous functions
Sort
View
ML
2006
ACM
13 years 8 months ago
Universal parameter optimisation in games based on SPSA
Most game programs have a large number of parameters that are crucial for their performance. While tuning these parameters by hand is rather difficult, efficient and easy to use ge...
Levente Kocsis, Csaba Szepesvári
MOBIHOC
2010
ACM
13 years 6 months ago
Near optimal multi-application allocation in shared sensor networks
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
You Xu, Abusayeed Saifullah, Yixin Chen, Chenyang ...
CVPR
2008
IEEE
14 years 10 months ago
Learning class-specific affinities for image labelling
Spectral clustering and eigenvector-based methods have become increasingly popular in segmentation and recognition. Although the choice of the pairwise similarity metric (or affin...
Dhruv Batra, Rahul Sukthankar, Tsuhan Chen
KSEM
2009
Springer
14 years 3 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
NIPS
2007
13 years 10 months ago
An Analysis of Convex Relaxations for MAP Estimation
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....