1169 search results - page 140 / 234 » Comparing performance of algorithms for generating concept l... |
CASES
2009
ACM
14 years 3 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
ICDM
2003
IEEE
14 years 2 months ago
2003
IEEE
Discovering underlying structure from co-occurrence data is an important task in a variety of fields, including: insurance, intelligence, criminal investigation, epidemiology, hu...
AOSD
2007
ACM
14 years 27 days ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
CSDA
2006
13 years 9 months ago
2006
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
WILF
2009
Springer
14 years 1 months ago
2009
Springer
In this paper, an interactive image retrieval scheme using MPEG-7 visual descriptors is proposed. The performance of image retrieval systems is still limited due to semantic gap, w...