511 search results - page 30 / 103 » The intrinsic dimensionality of graphs |
TIT
1998
13 years 9 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
ICTAI
2007
IEEE
14 years 4 months ago
2007
IEEE
Context-sensitive graph grammar construction tools have been used to develop and study interesting languages. However, the high dimensionality of graph grammars result in costly e...
ICDAR
2003
IEEE
14 years 3 months ago
2003
IEEE
Structure analysis of table form document is important because printed documents and also electronical documents only provide geometrical layout and lexical information explicitly...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
CGO
2004
IEEE
14 years 1 months ago
2004
IEEE
Traditionally, software pipelining is applied either to the innermost loop of a given loop nest or from the innermost loop to outer loops. In this paper, we propose a threestep ap...