2542 search results - page 443 / 509 » Computing Cartograms with Optimal Complexity |
COLT
1993
Springer
14 years 1 months ago
1993
Springer
In this paper we demonstrate how weighted majority voting with multiplicative weight updating can be applied to obtain robust algorithms for learning binary relations. We first pre...
COMPGEOM
1993
ACM
14 years 1 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
CCS
2006
ACM
14 years 20 days ago
2006
ACM
Attributes define, classify, or annotate the datum to which they are assigned. However, traditional attribute architectures and cryptosystems are ill-equipped to provide security ...
FOIKS
2006
Springer
14 years 18 days ago
2006
Springer
Abstract. Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical inconsistency easily. This p...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We present a new deterministic sorting algorithm that interleaves the partitioning of a sample sort with merging. Sequentially, it sorts n elements in O(n log n) time cache-oblivi...