1525 search results - page 42 / 305 » Matching with Regular Constraints |
101
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
Sparsity constraints are now very popular to regularized inverse problems. We review several approaches which have been proposed in the last ten years to solve inverse problems su...
133
Voted
DEXAW
2005
IEEE
15 years 5 months ago
2005
IEEE
In this paper, we study semistructured data and indexes preserving inclusion constraints. A semistructured datum is modelled by multi-rooted edge-labeled directed graphs. We consi...
139
Voted
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Deep Payload Inspection systems like SNORT and BRO utilize regular expression for their rules due to their high expressibility and compactness. The SNORT IDS system uses the PCRE ...
120
Voted
MIR
2006
ACM
15 years 9 months ago
2006
ACM
We present a general approach for automatically matching electronic slides to videos of corresponding presentations for use in distance learning and video proceedings of conferenc...
104
Voted
FCT
2005
Springer
15 years 9 months ago
2005
Springer
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...