13603 search results - page 54 / 2721 » On the Complexity of Computing Treelength |
128
click to vote
DCC
2005
IEEE
16 years 3 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
119
click to vote
SUTC
2006
IEEE
15 years 10 months ago
2006
IEEE
In computer security, many researches have tackled on the possibility of a unified model of access control, which could enforce any access control policies within a single unified...
117
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
A genomic computing network is a variant of a neural network for which a genome encodes all aspects, both structural and functional, of the network. The genome is evolved by a gen...
115
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
A sup-interpretation is a tool which provides upper bounds on the size of the values computed by the function symbols of a program. Sup-interpretations have shown their interest to...
131
click to vote
TMC
2008
15 years 3 months ago
2008
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...