3415 search results - page 171 / 683 » Lower Bounds for Kernelizations |
141
click to vote
ACL
2012
13 years 7 months ago
2012
Many researchers have attempted to predict the Enron corporate hierarchy from the data. This work, however, has been hampered by a lack of data. We present a new, large, and freel...
160
click to vote
CIARP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
122
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
—We propose a new method for online estimation of probabilistic discriminative models. The method is based on the recently proposed online Kernel Density Estimation (oKDE) framew...
170
click to vote
PAMI
2011
14 years 11 months ago
2011
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
118
click to vote
STOC
2001
ACM
16 years 5 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...