494 search results - page 54 / 99 » Heap Building Bounds |
DLOG
2008
15 years 1 months ago
2008
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
CDC
2008
IEEE
15 years 1 months ago
2008
IEEE
The problem of characterizing lower bounds on data-rates needed for closed loop stability has been solved in a variety of settings. However, the available results lead to coding s...
CIE
2008
Springer
15 years 1 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
IKE
2007
15 years 13 days ago
2007
- Organizations need to build and use knowledge to remain viable in the face of competition and change. Due to the limits of organization and the bounded rationality of individuals...
ACL
2001
15 years 11 days ago
2001
Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are diff...