5634 search results - page 89 / 1127 » About Abstract Classes |
72
Voted
MFCS
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
PAKDD
2010
ACM
15 years 3 months ago
2010
ACM
Abstract. It is well known that diversity among component classifiers is crucial for constructing a strong ensemble. Most existing ensemble methods achieve this goal through resam...
171
Voted
POPL
2005
ACM
15 years 11 months ago
2005
ACM
Haskell's type classes allow ad-hoc overloading, or typeindexing, of functions. A natural generalisation is to allow type-indexing of data types as well. It turns out that th...
101
click to vote
CIE
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
COCO
1990
Springer
15 years 3 months ago
1990
Springer
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...