2252 search results - page 278 / 451 » Improving Random Forests |
113
click to vote
KDD
2006
ACM
16 years 1 months ago
2006
ACM
Recent work has shown the feasibility and promise of templateindependent Web data extraction. However, existing approaches use decoupled strategies ? attempting to do data record ...
95
Voted
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
In this paper, we present CONTRAlign, an extensible and fully automatic framework for parameter learning and protein pairwise sequence alignment using pair conditional random field...
101
Voted
ECIR
2009
Springer
15 years 10 months ago
2009
Springer
Opinion finding is a challenging retrieval task, where it has been shown that it is especially difficult to improve over a strongly performing topic-relevance baseline. In this pa...
ALT
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
79
Voted
ICCD
2008
IEEE
15 years 9 months ago
2008
IEEE
High associativity is important for level-two cache designs [9]. Implementing CAM-based Highly Associative Caches (CAM-HAC), however, is both costly in hardware and exhibits poor s...