5115 search results - page 448 / 1023 » On Randomized Lanczos Algorithms |
167
click to vote
ECCV
2006
Springer
15 years 11 months ago
2006
Springer
In this paper we present a simple method for flattening of triangulated surfaces for mapping and imaging. The method is based on classical results of F. Gehring and Y. V
181
click to vote
ACL
1994
15 years 9 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...
189
click to vote
SIAMCOMP
2008
15 years 7 months ago
2008
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
183
click to vote
SIGMETRICS
2008
ACM
15 years 7 months ago
2008
ACM
Several peer-to-peer systems for live streaming have been recently deployed (e.g. CoolStreaming, PPLive, SopCast). These all rely on distributed, epidemic-style dissemination mech...
215
click to vote
MST
2010
15 years 6 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...