2766 search results - page 294 / 554 » Algorithms for trigonometric polynomials |
113
click to vote
NECO
2008
15 years 5 months ago
2008
A new gradient technique is introduced for linear ICA based on the Edgeworth expansion of mutual information, for which the algorithm operates sequentially using fixed-point itera...
122
Voted
TCS
2008
15 years 4 months ago
2008
Most genome rearrangements (e.g., reversals and translocations) can be represented as 2-breaks that break a genome at 2 points and glue the resulting fragments in a new order. Mul...
111
Voted
TSMC
2008
15 years 4 months ago
2008
This paper deals with the problem of optimally matching two ordered sets of 3-D points by means of a rigid displacement. Contrary to the standard approach, where a sumof-squared-er...
141
click to vote
COMPUTING
2004
15 years 4 months ago
2004
We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equation...
118
Voted
SIAMDM
2000
15 years 4 months ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...