Sciweavers

4767 search results - page 413 / 954
» Structures for Abstract Rewriting
Sort
View
IJFCS
2006
108views more  IJFCS 2006»
15 years 6 months ago
Reconstructing a Suffix Array
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
Frantisek Franek, William F. Smyth
JCT
2008
100views more  JCT 2008»
15 years 6 months ago
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
Frank Vallentin
KI
2008
Springer
15 years 6 months ago
High-Level Expectations for Low-Level Image Processing
Abstract. Scene interpretation systems are often conceived as extensions of low-level image analysis with bottom-up processing for high-level interpretations. In this contribution ...
Lothar Hotz, Bernd Neumann, Kasim Terzic
TCOS
2008
15 years 6 months ago
On Reduct Construction Algorithms
This paper critically analyzes reduct construction methods evels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic g...
Yiyu Yao, Yan Zhao, Jue Wang
TIT
2008
74views more  TIT 2008»
15 years 6 months ago
Sum Capacity of One-Sided Parallel Gaussian Interference Channels
Abstract--The sum capacity of the one-sided parallel Gaussian interference channel is shown to be a concave function of user powers. Exploiting the inherent structure of the proble...
Chi Wan Sung, Kenneth Wing-Kin Lui, Kenneth W. Shu...