6045 search results - page 75 / 1209 » Computable Linearizations of Well-partial-orderings |
IMR
2004
Springer
14 years 1 months ago
2004
Springer
Generating large 3D unstructured meshes with over 1 billion elements has been a challenging task. Fortunately, for a large class of applications with relatively simple geometries,...
TAPIA
2003
ACM
14 years 1 months ago
2003
ACM
In this paper we present an infeasible path-following interiorpoint algorithm for solving linear programs using a relaxed notion of the central path, called quasicentral path, as ...
FOCS
2000
IEEE
14 years 9 days ago
2000
IEEE
We prove that Best Fit bin packing has linear waste on the discrete distribution Ufj kg (where items are drawn uniformly from the set f1=k 2=3 j=kg) for sufficiently large k when...
IPPS
1999
IEEE
14 years 5 days ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....
DIS
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...