2638 search results - page 203 / 528 » Extracting Approximate Patterns |
143
click to vote
COCOON
2010
Springer
15 years 11 months ago
2010
Springer
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span t...
163
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
The likelihood for patterns of continuous attributes for the naive Bayesian classifier (NBC) may be approximated by kernel density estimation (KDE), letting every pattern influenc...
153
click to vote
DAC
2009
ACM
16 years 7 months ago
2009
ACM
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
188
click to vote
GCB
2004
Springer
15 years 12 months ago
2004
Springer
: We introduce the novel concept of graph alignment, a generalization of graph isomorphism that is motivated by the commonly used multiple sequence alignments. Graph alignments and...
167
click to vote
ICML
1999
IEEE
16 years 7 months ago
1999
IEEE
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...