3415 search results - page 192 / 683 » Lower bounds on kernelization |
194
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
155
click to vote
PKDD
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
200
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
165
click to vote
NIPS
2008
15 years 7 months ago
2008
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
149
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...