5329 search results - page 126 / 1066 » The Weighted Majority Algorithm |
GD
2008
Springer
13 years 11 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
EMNLP
2010
13 years 8 months ago
2010
Confidence-Weighted linear classifiers (CW) and its successors were shown to perform well on binary and multiclass NLP problems. In this paper we extend the CW approach for sequen...
ICPR
2010
IEEE
13 years 8 months ago
2010
IEEE
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a...
ALGORITHMICA
2011
13 years 5 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
We investigate balls-and-bins processes where m weighted balls are placed into n bins using the "power of two choices" paradigm, whereby a ball is inserted into the less...