1405 search results - page 107 / 281 » Anytime Algorithm for Feature Selection |
175
Voted
POPL
2003
ACM
16 years 2 months ago
2003
ACM
We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so tha...
PR
2006
15 years 2 months ago
2006
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
147
click to vote
TSE
2011
14 years 9 months ago
2011
—Randomized testing is an effective method for testing software units. Thoroughness of randomized unit testing varies widely according to the settings of certain parameters, such...
107
click to vote
AAAI
2010
15 years 3 months ago
2010
Planning in large, partially observable domains is challenging, especially when a long-horizon lookahead is necessary to obtain a good policy. Traditional POMDP planners that plan...
123
click to vote
PSIVT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. In a process of insect footprint recognition, footprint segments need to be extracted from scanned insect footprints in order to find out appropriate features for classi...