Sciweavers

12194 search results - page 284 / 2439
» Numberings Optimal for Learning
Sort
View
SIGECOM
2003
ACM
122views ECommerce» more  SIGECOM 2003»
15 years 12 months ago
On polynomial-time preference elicitation with value queries
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
Martin Zinkevich, Avrim Blum, Tuomas Sandholm
JUCS
2008
130views more  JUCS 2008»
15 years 6 months ago
Feature Selection for the Classification of Large Document Collections
: Feature selection methods are often applied in the context of document classification. They are particularly important for processing large data sets that may contain millions of...
Janez Brank, Dunja Mladenic, Marko Grobelnik, Nata...
PAMI
2007
185views more  PAMI 2007»
15 years 6 months ago
A Two-Level Generative Model for Cloth Representation and Shape from Shading
In this paper we present a two-level generative model for representing the images and surface depth maps of drapery and clothes. The upper level consists of a number of folds whic...
Feng Han, Song Chun Zhu
ALT
1999
Springer
15 years 11 months ago
PAC Learning with Nasty Noise
We introduce a new model for learning in the presence of noise, which we call the Nasty Noise model. This model generalizes previously considered models of learning with noise. Th...
Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz
EMO
2009
Springer
190views Optimization» more  EMO 2009»
16 years 1 months ago
Solving Bilevel Multi-Objective Optimization Problems Using Evolutionary Algorithms
Abstract. Bilevel optimization problems require every feasible upperlevel solution to satisfy optimality of a lower-level optimization problem. These problems commonly appear in ma...
Kalyanmoy Deb, Ankur Sinha