Sciweavers

4066 search results - page 280 / 814
» Almost Complete Sets
Sort
View
ICML
2005
IEEE
16 years 7 months ago
Supervised clustering with support vector machines
Supervised clustering is the problem of training a clustering algorithm to produce desirable clusterings: given sets of items and complete clusterings over these sets, we learn ho...
Thomas Finley, Thorsten Joachims
WINE
2009
Springer
194views Economy» more  WINE 2009»
16 years 1 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
CPAIOR
2004
Springer
16 years 1 days ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
183
Voted
SSDBM
2002
IEEE
116views Database» more  SSDBM 2002»
15 years 11 months ago
A Conceptual Framework for Composing and Managing Scientific Data Lineage
Scientific research relies as much on the dissemination and exchange of data sets as on the publication of conclusions. Accurately tracking the lineage (origin and subsequent proc...
Rajendra Bose
ECAI
1998
Springer
15 years 11 months ago
Integrating Abduction and Induction
In this paper we describe an approach for integrating abduction and induction in the ILP setting of learning from interpretations with the aim of solving the problem of incomplete...
Fabrizio Riguzzi