146 search results - page 7 / 30 » The Complexity of Integer Bound Propagation |
77
Voted
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
81
Voted
ICALP
2001
Springer
15 years 2 months ago
2001
Springer
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
115
Voted
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
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...
187
click to vote
STOC
2012
ACM
13 years 15 hour ago
2012
ACM
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...