Sciweavers

1376 search results - page 65 / 276
» The Localization Hypothesis and Machines
Sort
View
ICML
2004
IEEE
14 years 10 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik
ICML
2010
IEEE
13 years 11 months ago
Non-Local Contrastive Objectives
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...
David Vickrey, Cliff Chiung-Yu Lin, Daphne Koller
EVOW
2001
Springer
14 years 2 months ago
Design of Iterated Local Search Algorithms
In this article we investigate the application of iterated local search (ILS) to the single machine total weighted tardiness problem. Our research is inspired by the recently propo...
Matthijs den Besten, Thomas Stützle, Marco Do...
ICCS
2001
Springer
14 years 2 months ago
Performance Prediction for Parallel Local Weather Forecast Programs
: Performance modeling for scientific production codes is of interest both for program tuning and for the selection of new machines. An empirical method is used for developing a m...
Wolfgang Joppich, Hermann Mierendorff
COLT
2005
Springer
14 years 3 months ago
Localized Upper and Lower Bounds for Some Estimation Problems
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
Tong Zhang