Sciweavers

780 search results - page 149 / 156
» Robustness and Randomness
Sort
View
120
Voted
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
15 years 5 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
139
Voted
CVPR
2010
IEEE
15 years 4 months ago
The Automatic Design of Feature Spaces for Local Image Descriptors using an Ensemble of Non-linear Feature Extractors
The design of feature spaces for local image descriptors is an important research subject in computer vision due to its applicability in several problems, such as visual classifi...
Gustavo Carneiro
113
Voted
ISIPTA
1999
IEEE
116views Mathematics» more  ISIPTA 1999»
15 years 4 months ago
On the Distribution of Natural Probability Functions
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
Jeff B. Paris, Paul N. Watton, George M. Wilmers
98
Voted
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 4 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
99
Voted
CP
2006
Springer
15 years 4 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann