1601 search results - page 59 / 321 » Closed Sets for Labeled Data |
140
click to vote
ALT
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
DATE
2005
IEEE
15 years 5 months ago
2005
IEEE
Customization of processor architectures through Instruction Set Extensions (ISEs) is an effective way to meet the growing performance demands of embedded applications. A high-qua...
81
Voted
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Accurately annotating entities in video is labor intensive and expensive. As the quantity of online video grows, traditional solutions to this task are unable to scale to meet the ...
ICONIP
2009
14 years 9 months ago
2009
Decision Tree Induction (DTI), one of the Data Mining classification methods, is used in this research for predictive problem solving in analyzing patient medical track records. In...
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...