6045 search results - page 269 / 1209 » Computable Linearizations of Well-partial-orderings |
257
click to vote
CLUSTER
2011
IEEE
14 years 7 months ago
2011
IEEE
—Much of dense linear algebra has been successfully blocked to concentrate the majority of its time in the Level 3 BLAS, which are not only efficient for serial computation, but...
174
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
We perform linear programming optimizations on the intersection of k polyhedra in R3 , represented by their outer recursive decompositions, in expected time O(k log k log n + √ ...
182
click to vote
CSR
2008
Springer
15 years 9 months ago
2008
Springer
We prove that every rational language of words indexed by linear orderings is definable in monadic second-order logic. We also show that the converse is true for the class of langu...
227
click to vote
HPCC
2007
Springer
15 years 11 months ago
2007
Springer
A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of th...
212
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...