Vector Space Representation of Concepts Using Wikipedia Graph Structure

Author(s):  
Armin Sajadi ◽  
Evangelos E. Milios ◽  
Vlado Keselj
2016 ◽  
Author(s):  
Nasrin Mostafazadeh ◽  
Lucy Vanderwende ◽  
Wen-tau Yih ◽  
Pushmeet Kohli ◽  
James Allen

2004 ◽  
Vol 22 (3) ◽  
pp. 704-715 ◽  
Author(s):  
Yasuhiro Kitazoe ◽  
Hirohisa Kishino ◽  
Takahisa Okabayashi ◽  
Teruaki Watabe ◽  
Noriaki Nakajima ◽  
...  

Author(s):  
Thomas Hunziker

Many common adaptive beamforming methods are based on a sample matrix inversion (SMI). The schemes can be applied in two ways. The sample covariance matrices are either computed over preambles, or the sample basis for the SMI and the target of the beamforming are identical. A vector space representation provides insight into the classic SMI-based beamforming variants, and enables elegant derivations of the well-known second-order statistical properties of the output signals. Moreover, the vector space representation is helpful in the definition of appropriate interfaces between beamfoming and soft-decision signal decoding in receivers aiming at adaptive cochannel interference mitigation. It turns out that the performance of standard receivers incorporating SMI-based beamforming on short signal intervals and decoding of BICM (bit-interleaved coded modulation) signals can be significantly improved by proper interface design.


Author(s):  
A.K.C. WONG ◽  
H.C. SHEN ◽  
P.W. WONG

This paper proposes a search-effective strategy for multi-class texture classification. The textures are classified according to the nearest neighbor rule based on our recently developed texture metric. We will show that it is possible to significantly reduce the amount of computation from an exhaustive search scheme. For this purpose, a distance-preserving vector space representation of the texture database is constructed. The representation facilitates the selection of a subset of class prototypes which constitute the reduced search space. In addition, the prototypes are organized into a hierarchy to further economize the search for the nearest class. This methodology is demonstrated by experiments on 720 texture samples belonging to eight classes. On average, a reduction of close to 70% is achieved.


Sign in / Sign up

Export Citation Format

Share Document