5128 search results - page 339 / 1026 » When Abstraction Fails |
185
click to vote
MCS
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. Multiclass SVMs are usually implemented by combining several two-class SVMs. The one-versus-all method using winner-takes-all strategy and the one-versus-one method imple...
171
click to vote
SARA
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. We present The Cruncher, a simple representation framework and algorithm based on minimum description length for automatically forming an ontology of concepts from attrib...
205
click to vote
STACS
2005
Springer
16 years 1 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
232
click to vote
ANTSW
2004
Springer
16 years 29 days ago
2004
Springer
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
160
click to vote
BIRTHDAY
2004
Springer
16 years 28 days ago
2004
Springer
del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the ov...