2004
DOI: 10.1016/j.ijar.2003.08.003
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive multiresolution search: How to beat brute force?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2007
2007
2024
2024

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…Let us mention that the algorithm can be refined in many ways, using a more sophisticated clustering algorithm and a better search algorithm such as a multiresolution search algorithm (Thuillard 2001, 2004) or a simulated annealing. The algorithm can also be improved by optimizing the order within the clusters with the same hill climber.…”
Section: Algorithm For Contradiction Minimizationmentioning
confidence: 99%
“…Let us mention that the algorithm can be refined in many ways, using a more sophisticated clustering algorithm and a better search algorithm such as a multiresolution search algorithm (Thuillard 2001, 2004) or a simulated annealing. The algorithm can also be improved by optimizing the order within the clusters with the same hill climber.…”
Section: Algorithm For Contradiction Minimizationmentioning
confidence: 99%
“…3). The first wavelet applications in sensors were developed for commercial fire detectors [7], [8]. A clear trend is the gradual establishment of hybrid techniques combining multiresolution analysis to other signal processing methods, for instance fuzzy logic, independent components (ICA) [9] or principal components analysis (PCA) [10].…”
Section: Intelligent Analyzersmentioning
confidence: 99%