791 search results - page 32 / 159 » Approximating the Maximum Sharing Problem |
121
click to vote
IJCAI
2007
15 years 4 months ago
2007
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
155
click to vote
DAGM
2008
Springer
15 years 4 months ago
2008
Springer
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
TNN
2008
15 years 3 months ago
2008
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
100
click to vote
IPL
2011
14 years 10 months ago
2011
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
134
click to vote
CIDR
2003
15 years 4 months ago
2003
We present an architecture for a data sharing peer-to-peer system where the data is shared in the form of database relations. In general, peer-to-peer systems try to locate exactm...