417 search results - page 31 / 84 » Generalization Bounds for Some Ordinal Regression Algorithms |
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into...
TIT
2002
13 years 8 months ago
2002
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
NIPS
2007
13 years 10 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...
JMLR
2010
13 years 7 months ago
2010
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and differen...
FSTTCS
2006
Springer
14 years 4 days ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...