253 search results - page 33 / 51 » The Sketching Complexity of Pattern Matching |
TVCG
2002
13 years 7 months ago
2002
Image databases are nowadays widely exploited in a number of different contexts, ranging from history of art, through medicine, to education. Existing querying paradigms are based ...
ICDE
2005
IEEE
14 years 8 months ago
2005
IEEE
We present ViteX, an XPath processing system on XML streams with polynomial time complexity. ViteX uses a polynomial-space data structure to encode an exponential number of patter...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
CVPR
2012
IEEE
11 years 9 months ago
2012
IEEE
A large number of vision applications rely on matching keypoints across images. The last decade featured an arms-race towards faster and more robust keypoints and association algo...
AUIC
2006
IEEE
14 years 1 months ago
2006
IEEE
Graphical rewrite rules are often used in programming environments for children. These rules consist of two parts: a left-hand side, which is visually matched in the environment, ...