1403 search results - page 114 / 281 » Set cover algorithms for very large datasets |
140
click to vote
ICIAP
2005
ACM
16 years 4 months ago
2005
ACM
An innovative algorithm for automatic generation of Huffman coding tables for semantic classes of digital images is presented. Collecting statistics over a large dataset of corresp...
129
Voted
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
It has been shown that the delay of a target path can be composed linearly of other path delays. If the later paths are robustly testable (with known delay values), the target pat...
133
click to vote
NECO
2008
15 years 4 months ago
2008
Iterative learning algorithms that approximate the solution of support vector machines (SVMs) have two potential advantages. First, they allow for online and active learning. Seco...
135
click to vote
AAAI
2008
15 years 6 months ago
2008
We introduce the problem of zero-data learning, where a model must generalize to classes or tasks for which no training data are available and only a description of the classes or...
143
click to vote
INAP
2001
Springer
15 years 9 months ago
2001
Springer
This paper presents new techniques for focusing the discoveryof frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent i...