910 search results - page 78 / 182 » Detecting False Matches in String Matching Algorithms |
129
click to vote
CVPR
2007
IEEE
16 years 5 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
149
click to vote
CGF
2011
14 years 6 months ago
2011
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
126
click to vote
ICCV
2007
IEEE
16 years 5 months ago
2007
IEEE
Real-world actions occur often in crowded, dynamic environments. This poses a difficult challenge for current approaches to video event detection because it is difficult to segmen...
122
click to vote
IJCV
2010
15 years 1 months ago
2010
Real-world actions occur often in crowded, dynamic environments. This poses a difficult challenge for current approaches to video event detection because it is difficult to segm...
264
click to vote
VLDB
2002
ACM
16 years 3 months ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...