3653 search results - page 550 / 731 » On Recognizable Timed Languages |
171
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
181
click to vote
PVLDB
2008
15 years 4 months ago
2008
Queries, or calls to stored procedures/user-defined functions are often invoked multiple times, either from within a loop in an application program, or from the where/select claus...
149
click to vote
REFSQ
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. [Context and motivation] Natural language is the main representation means of industrial requirements documents, which implies that requirements documents are inherently ...
194
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
189
click to vote
ER
2009
Springer
15 years 4 months ago
2009
Springer
: Conceptual modelling is a widely applied practice and has led to a large body of knowledge on constructs that might be used for modelling and on methods that might be useful for ...