99 search results - page 19 / 20 » Building Compilers by Combining Algebras |
DEXAW
2008
IEEE
13 years 9 months ago
2008
IEEE
In an authorship verification problem one is given writing examples from an author A, and one is asked to determine whether or not each text in fact was written by A. In a more ge...
GECCO
2005
Springer
14 years 29 days ago
2005
Springer
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
PPSC
1993
13 years 8 months ago
1993
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solvee ectively on massivelyparallel machines. Rather than trying to design a black box" ...
FSMNLP
2005
Springer
14 years 29 days ago
2005
Springer
Compounding is a very productive process in German to form complex nouns and adjectives which represent about 7% of the words of a newspaper text. Unlike English, German compounds ...
VRCAI
2004
ACM
14 years 26 days ago
2004
ACM
Despite steady research advances in many aspects of virtual reality, building and testing virtual worlds remains to be a very difficult process. Most virtual environments are stil...