7197 search results - page 1165 / 1440 » On the computational power of BlenX |
179
click to vote
NJC
2000
15 years 6 months ago
2000
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
122
click to vote
CN
1999
15 years 6 months ago
1999
This paper presents XForm -- a proposal for a general and powerful mechanism for handling forms in XML. XForm defines form -- related constructs independent of any particular XML ...
186
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
—Wireless sensor networks consist of sensor nodes with limited computational and communication capabilities. In this paper, the whole network of sensor nodes is divided into clus...
187
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
175
click to vote
IAJIT
2010
15 years 5 months ago
2010
: This paper proposes a pipelined, systolic architecture for two- dimensional discrete Fourier transform computation which is highly concurrent. The architecture consists of two, o...