10271 search results - page 1895 / 2055 » Computer Science |
204
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
Matching regular expressions (regexps) is a very common workload. For example, tokenization, which consists of recognizing words or keywords in a character stream, appears in ever...
164
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
Several existing compiler transformations can help improve communication-computation overlap in MPI applications. However, traditional compilers treat calls to the MPI library as ...
202
click to vote
ICST
2009
IEEE
16 years 1 months ago
2009
IEEE
It is challenging to test applications and functions for which the correct output for arbitrary input cannot be known in advance, e.g. some computational science or machine learni...
148
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the standard model of finite two-person zero-sum stochastic games with signals. We are interested in the existence of almost-surely winning or positively winning stra...
193
click to vote
LICS
2009
IEEE
16 years 1 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...