3724 search results - page 128 / 745 » Timed regular expressions |
160
click to vote
PEPM
1993
ACM
15 years 8 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
127
Voted
CMA
2010
15 years 1 months ago
2010
This report develops and studies a new family of NSE-regularizations, Tikhonov Leray Regularization with Time Relaxation Models. This new family of turbulence models is based on a...
140
click to vote
Publication
The most expressive way humans display emotions is through facial expressions. Humans detect and interpret faces and facial expressions in a scene with little or no effort. Still, ...
160
click to vote
DAGM
2003
Springer
15 years 9 months ago
2003
Springer
A new direction in improving modern dialogue systems is to make a human-machine dialogue more similar to a human-human dialogue. This can be done by adding more input modalities, e...
133
click to vote
CP
2010
Springer
15 years 2 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...