3724 search results - page 168 / 745 » Timed regular expressions |
100
click to vote
MICRO
2000
IEEE
15 years 9 months ago
2000
IEEE
Many data-parallel applications, including emerging media applications, have regular structures that can easily be expressed as a series of arithmetic kernels operating on data st...
124
click to vote
MFCS
1998
Springer
15 years 8 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
191
click to vote
CAAP
1994
15 years 8 months ago
1994
Top-context-free tree languages (called cor gulier by Arnold and Dauchet 1, 2]) constitute a natural subclass of context-free tree languages. In this paper, we give further evidenc...
181
click to vote
CVPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Learning a robust projection with a small number of training samples is still a challenging problem in face recognition, especially when the unseen faces have extreme variation in...
137
click to vote
ENTCS
2008
15 years 4 months ago
2008
The graph rewriting calculus is an extension of the -calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using u...