16430 search results - page 181 / 3286 » On Computable Tree Functions |
106
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper, we propose tree structure lossless coding, by which compression data are arranged in a tree structure. Current compression methods show improved performance by prod...
97
Voted
CIE
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We prove that for any k 3 each element of the homomorphic quasiorder of finite k-labeled forests is definable, provided that the minimal non-smallest elements are allowe...
119
click to vote
CADE
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. The rank/activity restriction on binary resolution is introduced. It accepts only a single derivation tree from a large equivalence class of such trees. The equivalence c...
128
click to vote
EMNLP
2008
15 years 5 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...
125
Voted
ICPR
2010
IEEE
15 years 1 months ago
2010
IEEE
In the presence of non-gaussian noise, we propose a method for the detection of underwater shipradiated signal. The wavelet decomposition of the underwater signal yields a natural...