215 search results - page 41 / 43 » The asymptotic number of binary codes and binary matroids |
206
click to vote
TABLEAUX
2000
Springer
15 years 9 months ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
165
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
320
click to vote
PLDI
2009
ACM
16 years 6 months ago
2009
ACM
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
263
click to vote
ASPLOS
2009
ACM
16 years 6 months ago
2009
ACM
Miss rate curves (MRCs) are useful in a number of contexts. In our research, online L2 cache MRCs enable us to dynamically identify optimal cache sizes when cache-partitioning a s...
149
click to vote
COCOON
2009
Springer
16 years 13 days ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...