1525 search results - page 64 / 305 » Matching with Regular Constraints |
140
Voted
ISMVL
2000
IEEE
15 years 8 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
147
Voted
ICIP
2010
IEEE
2010
IEEE
Restoration of images and 3D data to higher resolution by deconvolution with sparsity regularization
15 years 1 months ago
Image convolution is conventionally approximated by the LTI discrete model. It is well recognized that the higher the sampling rate, the better is the approximation. However somet...
137
Voted
PLDI
2004
ACM
15 years 9 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
112
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
When seeking a sparse representation of a signal on a redundant basis, one might want to convey available a priori information on the observations to the optimization criterion. I...
143
click to vote
ANCS
2007
ACM
15 years 7 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...