Sciweavers

8413 search results - page 264 / 1683
» Ordering Problem Subgoals
Sort
View
ACL
2007
15 years 4 months ago
Optimizing Grammars for Minimum Dependency Length
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
Daniel Gildea, David Temperley
AMC
2008
92views more  AMC 2008»
15 years 3 months ago
Explicit multi-step peer methods for special second-order differential equations
The construction of s-stage explicit two- and three-step peer methods of order p = 2s and p = 3s is considered for the solution of non-stiff second order initial value problems wh...
Stefan Jebens, Rüdiger Weiner, Helmut Podhais...
IJFCS
2006
108views more  IJFCS 2006»
15 years 3 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
ADCM
2005
79views more  ADCM 2005»
15 years 2 months ago
Flexible piecewise approximations based on partition of unity
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
Weimin Han, Wing Kam Liu
JSCIC
2007
100views more  JSCIC 2007»
15 years 2 months ago
Implicit-Explicit Schemes for BGK Kinetic Equations
In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be con...
Sandra Pieraccini, Gabriella Puppo