128 search results - page 10 / 26 » Lower bounds for adaptive collect and related objects |
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The imposs...
ICPR
2010
IEEE
13 years 6 months ago
2010
IEEE
We present a new method for the incremental training of multiclass Support Vector Machines that provides computational efficiency for training problems in the case where the trai...
COMPGEOM
1994
ACM
13 years 11 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
GIS
2006
ACM
14 years 8 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...
EDBT
2004
ACM
14 years 28 days ago
2004
ACM
Abstract. We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections...