Sciweavers

263 search results - page 11 / 53
» On the Containment of Forbidden Patterns Problems
Sort
View
IPL
2007
91views more  IPL 2007»
14 years 9 months ago
Simple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, all...
Peter Clifford, Raphaël Clifford
108
Voted
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
15 years 2 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
82
Voted
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
14 years 9 months ago
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
Abstract A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in r...
Yan Huang, Jian Pei, Hui Xiong
73
Voted
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
15 years 1 months ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
EMMCVPR
2001
Springer
15 years 2 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...