2766 search results - page 85 / 554 » Algorithms for trigonometric polynomials |
98
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
113
Voted
ALGORITHMICA
2008
15 years 28 days ago
2008
We present exact algorithms with exponential running times for variants of n-element set cover problems, based on divide-and-conquer and on inclusion
125
click to vote
WADS
2007
Springer
15 years 7 months ago
2007
Springer
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial ti...
98
Voted
PVLDB
2010
14 years 11 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
128
Voted
ICASSP
2011
IEEE
14 years 4 months ago
2011
IEEE
In the independent component analysis, polynomial functions of higher order statistics are often used as cost functions. However, such cost functions usually have many local minim...