6693 search results - page 817 / 1339 » Methods of Automatic Algorithm Generation |
154
click to vote
ECML
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Learning to act in an unknown partially observable domain is a difficult variant of the reinforcement learning paradigm. Research in the area has focused on model-free m...
181
click to vote
DAC
2003
ACM
15 years 11 months ago
2003
ACM
Reduction of an extracted netlist is an important pre-processing step for techniques such as model order reduction in the design and analysis of VLSI circuits. This paper describe...
149
Voted
NAACL
2003
15 years 7 months ago
2003
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling...
188
click to vote
BIBE
2005
IEEE
15 years 12 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
163
click to vote
WACV
2008
IEEE
16 years 21 days ago
2008
IEEE
Most face recognition algorithms use a “distancebased” approach: gallery and probe images are projected into a low dimensional feature space and decisions about matching are b...