6045 search results - page 967 / 1209 » Computable Linearizations of Well-partial-orderings |
193
click to vote
JSCIC
2008
15 years 6 months ago
2008
Solutions of the master equation are approximated using a hierarchy of models based on the solution of ordinary differential equations: the macroscopic equations, the linear noise...
186
click to vote
MP
2008
15 years 6 months ago
2008
The simplex algorithm computes the simplex multipliers by solving a system (or two triangular systems) at each iteration. This note offers an efficient approach to updating the sim...
158
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
131
Voted
JMLR
2007
15 years 6 months ago
2007
The concepts of similarity and distance are crucial in data mining. We consider the problem of defining the distance between two data sets by comparing summary statistics compute...
147
click to vote
CAD
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we study the problem of constructing a family of surfaces from a given spatial geodesic curve. We derive a parametric representation for a surface pencil whose memb...