Sciweavers

3731 search results - page 149 / 747
» cases 2006
Sort
View
AAIM
2006
Springer
97views Algorithms» more  AAIM 2006»
16 years 14 days ago
Note on an Auction Procedure for a Matching Game in Polynomial Time
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...
Winfried Hochstättler, Hui Jin 0002, Robert N...
ANTS
2006
Springer
118views Algorithms» more  ANTS 2006»
15 years 10 months ago
Computation of Locally Free Class Groups
We show that the locally free class group of an order in a semisimple algebra over a number field is isomorphic to a certain ray class group. This description is then used to prese...
Werner Bley, Robert Boltje
CIAC
2006
Springer
100views Algorithms» more  CIAC 2006»
15 years 10 months ago
Distributed Approximation Algorithms for Planar Graphs
In this paper we construct two distributed algorithms for computing approximations of a largest matching and a minimum dominating set in planar graphs on n vertices. The approximat...
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szyman...
CICLING
2006
Springer
15 years 10 months ago
Improving kNN Text Categorization by Removing Outliers from Training Set
We show that excluding outliers from the training data significantly improves kNN classifier, which in this case performs about 10% better than the best know method--Centroid-based...
Kwangcheol Shin, Ajith Abraham, Sang-Yong Han
DIAGRAMS
2006
Springer
15 years 10 months ago
Fixing Shin's Reading Algorithm for Peirce's Existential Graphs
In her book "The Iconic Logic of Peirce's Graphs", S. J. Shin elaborates the diagrammatic logic of Peirce's Existential Graphs. Particularly, she provides trans...
Frithjof Dau