4698 search results - page 10 / 940 » Making Functionality More General |
BIRTHDAY
1994
Springer
15 years 1 months ago
1994
Springer
Cook's construction from 1971 [4] shows that any two-way deterministic pushdown automaton (2DPDA) can be simulated in time O(n), where n is the length of its input string, and...
AAAI
2008
14 years 12 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
119
click to vote
DLOG
2011
14 years 1 months ago
2011
Recent research has shown that labeling ontologies can be useful for restricting the access to some of the axioms and their implicit consequences. However, the labeling of the axio...
88
Voted
ICFP
2002
ACM
15 years 9 months ago
2002
ACM
We propose an extension of Haskell's type class system with bstractions in the type language. Type inference for our extension relies on a novel constrained unification proce...
ALT
2004
Springer
15 years 6 months ago
2004
Springer
We investigate further improvement of boosting in the case that the target concept belongs to the class of r-of-k threshold Boolean functions, which answer “+1” if at least r o...