6045 search results - page 1174 / 1209 » Computable Linearizations of Well-partial-orderings |
144
click to vote
TOG
2008
15 years 5 months ago
2008
Our goal is to simulate the full hair geometry, consisting of approximately one hundred thousand hairs on a typical human head. This will require scalable methods that can simulat...
150
click to vote
ICS
1997
Tsinghua U.
15 years 9 months ago
1997
Tsinghua U.
Modern microprocessors can achieve high performance on linear algebra kernels but this currently requires extensive machine-speci c hand tuning. We have developed a methodology wh...
313
click to vote
DIMACS
1996
15 years 6 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
170
click to vote
CONPAR
1994
15 years 9 months ago
1994
The rapid advances in high-performancecomputer architectureand compilationtechniques provide both challenges and opportunitiesto exploitthe rich solution space of software pipeline...
185
click to vote
STACS
1992
Springer
15 years 9 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...