2409 search results - page 173 / 482 » On Extended Regular Expressions |
204
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Boundeddegreenetworks like deBruijn graphsor wrapped butterfly networks are very important from VLSI implementation point of view as well as for applications where the computing n...
161
click to vote
SWAT
1998
Springer
15 years 11 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
176
click to vote
ENC
2004
IEEE
15 years 10 months ago
2004
IEEE
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
179
click to vote
LREC
2010
15 years 8 months ago
2010
We describe the implementation of an enterprise monitoring system that builds on an ontology-based information extraction (OBIE) component applied to heterogeneous data sources. T...
163
click to vote
DLT
2006
15 years 8 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...