8669 search results - page 384 / 1734 » Computing matrix representations |
192
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
178
click to vote
FLAIRS
2004
15 years 8 months ago
2004
We present results from experiments in using several pitch representations for jazz-oriented musical tasks performed by a recurrent neural network. We have run experiments with se...
208
click to vote
NECO
2010
15 years 5 months ago
2010
Neurons in the input layer of primary visual cortex in primates develop edge-like receptive fields. One approach to understanding the emergence of this response is to state that ...
186
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
204
click to vote
MSS
2000
IEEE
15 years 11 months ago
2000
IEEE
The CEDARS∗ project within UK academia seeks to develop a demonstrator system to recommend techniques for long-term storage of digital data primarily within the research library...