81 search results - page 11 / 17 » Empirical Lower Bounds on the Complexity of Translational Eq... |
100
click to vote
ACL
2011
14 years 1 months ago
2011
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
100
Voted
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
For the discovery of similar patterns in 1D time-series, it is very typical to perform a normalization of the data (for example a transformation so that the data follow a zero mea...
117
click to vote
JMLR
2010
14 years 4 months ago
2010
We prove the statistical consistency of kernel Partial Least Squares Regression applied to a bounded regression learning problem on a reproducing kernel Hilbert space. Partial Lea...
COMCOM
2004
14 years 9 months ago
2004
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...