5523 search results - page 902 / 1105 » Improving application performance with hardware data structu... |
151
click to vote
DASFAA
2004
IEEE
15 years 8 months ago
2004
IEEE
Text classification using a small labeled set and a large unlabeled data is seen as a promising technique to reduce the labor-intensive and time consuming effort of labeling traini...
153
click to vote
IJSI
2008
15 years 4 months ago
2008
Many data mining applications have a large amount of data but labeling data is often difficult, expensive, or time consuming, as it requires human experts for annotation. Semi-supe...
156
click to vote
PPOPP
2012
ACM
14 years 7 days ago
2012
ACM
We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-specu...
140
click to vote
PLDI
2006
ACM
15 years 10 months ago
2006
ACM
Atomic blocks allow programmers to delimit sections of code as ‘atomic’, leaving the language’s implementation to enforce atomicity. Existing work has shown how to implement...
144
Voted
BMCBI
2010
2010
Orientation-dependent backbone-only residue pair scoring functions for fixed backbone protein design
15 years 4 months ago
Background: Empirical scoring functions have proven useful in protein structure modeling. Most such scoring functions depend on protein side chain conformations. However, backbone...