1862 search results - page 253 / 373 » Constrained pattern matching |
175
click to vote
TASE
2010
IEEE
14 years 10 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
184
click to vote
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
343
click to vote
ICA
2012
Springer
13 years 10 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
132
click to vote
ICSE
2008
IEEE-ACM
16 years 4 months ago
2008
IEEE-ACM
Program specifications are important in many phases of the software development process, but they are often omitted or incomplete. An important class of specifications takes the f...
150
click to vote
ANCS
2006
ACM
15 years 9 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...