3136 search results - page 203 / 628 » Comparison of Clique-Listing Algorithms |
172
click to vote
MMSEC
2005
ACM
16 years 22 hour ago
2005
ACM
We present a non-oblivious, extremely robust watermarking scheme for audio signals. The watermarking algorithm is based on the SVD of the spectrogram of the signal. The SVD of the...
143
click to vote
ICCBR
2005
Springer
15 years 12 months ago
2005
Springer
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...
165
click to vote
JCDL
2004
ACM
15 years 12 months ago
2004
ACM
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...
181
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
157
click to vote
ICCSA
2004
Springer
15 years 12 months ago
2004
Springer
The algorithmic techniques which allow high efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges are ...