9842 search results - page 1436 / 1969 » The Complexity of the Matching-Cut Problem |
181
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
Discovering additive structure is an important step towards understanding a complex multi-dimensional function because it allows the function to be expressed as the sum of lower-d...
172
click to vote
ICML
2008
IEEE
16 years 8 months ago
2008
IEEE
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
158
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
197
click to vote
ICML
2005
IEEE
16 years 8 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
191
click to vote
ICML
2002
IEEE
16 years 8 months ago
2002
IEEE
Searching the space of policies directly for the optimal policy has been one popular method for solving partially observable reinforcement learning problems. Typically, with each ...