2766 search results - page 479 / 554 » Algorithms for trigonometric polynomials |
107
Voted
DAGSTUHL
2006
15 years 5 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
125
Voted
IJCAI
2003
15 years 5 months ago
2003
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
136
Voted
UAI
2004
15 years 5 months ago
2004
We introduce the study of sequential information elicitation in strategic multi-agent systems. In an information elicitation setup a center attempts to compute the value of a func...
97
Voted
NIPS
2003
15 years 5 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
107
Voted
NIPS
2003
15 years 5 months ago
2003
Clustering aims at extracting hidden structure in dataset. While the problem of finding compact clusters has been widely studied in the literature, extracting arbitrarily formed ...