1399 search results - page 3 / 280 » New Algorithms for k-Center and Extensions |
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
CAD
2002
Springer
14 years 11 months ago
2002
Springer
This paper presents an algorithm for extending B-spline curves and surfaces. Based on the unclamping algorithm for B-spline curves, we propose a new algorithm for extending B-spli...
99
Voted
WSC
2007
15 years 1 months ago
2007
DIRECT (DIviding RECTangles) is a deterministic global optimization algorithm for bound-constrained problems. The algorithm, based on a space-partitioning scheme, performs both gl...
114
click to vote
PR
2011
14 years 6 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
97
Voted
COLT
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We present a generalization of the Perceptron algorithm. The new algorithm performs a Perceptron-style update whenever the margin of an example is smaller than a predefi...