7129 search results - page 677 / 1426 » Approximation Algorithms for Treewidth |
181
click to vote
ACL
1994
15 years 8 months ago
1994
The computational lexicalization of a grammar is the optimization of the links between lexicalized rules and lexical items in order to improve the quality of the bottom-up filteri...
186
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
218
Voted
FOCM
2007
15 years 7 months ago
2007
We consider the regression problem and describe an algorithm approximating the regression function by estimators piecewise constant on the elements of an adaptive partition. The pa...
183
click to vote
SIAMSC
2008
15 years 7 months ago
2008
In this paper we present a new incomplete factorization of a square matrix into triangular factors in which we get standard LU or LDLT factors (direct factors) and their inverses (...
187
click to vote
IPL
2007
15 years 7 months ago
2007
We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...