563 search results - page 78 / 113 » Computing approximate PSD factorizations |
EWCBR
2004
Springer
14 years 3 months ago
2004
Springer
Over the years, many successful applications of case-based reasoning (CBR) systems have been developed in different areas. The performance of CBR systems depends on several factor...
ICALP
2003
Springer
14 years 3 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
DAWAK
2001
Springer
14 years 2 months ago
2001
Springer
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining applications, particularly for domains such as multimedia, CAD, molecular ...
APCCAS
2006
IEEE
13 years 12 months ago
2006
IEEE
- In this paper, the grouped scheme is specially applied to compute the fast Fourier transform (FFT) when the portions of transformed outputs are calculated selectively. The groupe...
TAMC
2010
Springer
13 years 8 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...