1632 search results - page 82 / 327 » Sublinear Time Algorithms for Metric Space Problems |
156
click to vote
WADS
1993
Springer
15 years 7 months ago
1993
Springer
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
118
click to vote
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
135
Voted
SADM
2010
15 years 1 months ago
2010
: This paper proposes twin prototype support vector machine (TVM), a constant space and sublinear time support vector machine (SVM) algorithm for online learning. TVM achieves its ...
140
Voted
AAECC
2006
Springer
15 years 3 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
153
Voted
TSMC
2010
14 years 10 months ago
2010
The memory dumping problem arises in the context of planning and scheduling activities of the Mars Express mission of the European Space Agency. The problem consists of scheduling...