Sciweavers

1046 search results - page 76 / 210
» Approximation Algorithms for Domination Search
Sort
View
104
Voted
FUIN
2007
123views more  FUIN 2007»
15 years 14 days ago
Analysis of Approximate Petri Nets by Means of Occurrence Graphs
Abstract. Approximate Petri nets (AP-nets) can be used for the knowledge representation and approximate reasoning. The AP-net model is defined on the basis of the rough set approa...
Zbigniew Suraj, Barbara Fryc
116
Voted
DPHOTO
2009
154views Hardware» more  DPHOTO 2009»
14 years 10 months ago
Optimal color filter array design: quantitative conditions and an efficient search procedure
Most digital cameras employ a spatial subsampling process, implemented as a color filter array (CFA), to capture color images. The choice of CFA patterns has a great impact on the...
Yue M. Lu, Martin Vetterli
102
Voted
GECCO
2009
Springer
112views Optimization» more  GECCO 2009»
15 years 7 months ago
Approximating geometric crossover in semantic space
We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program’s eval...
Krzysztof Krawiec, Pawel Lichocki
91
Voted
SPIRE
1999
Springer
15 years 4 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
15 years 2 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha