1099 search results - page 201 / 220 » On the Complexity of Computing Evolutionary Trees |
137
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Parallel programming is seen as an effective technique to improve the performance of computationally-intensive programs. This is done at the cost of increasing the complexity of t...
148
click to vote
IWPC
2002
IEEE
15 years 10 months ago
2002
IEEE
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
153
click to vote
ESORICS
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. We consider the problem of efficient key management and user revocation in cryptographic file systems that allow shared access to files. A performanceefficient solution t...
142
click to vote
IDA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
189
click to vote
COMPGEOM
2008
ACM
15 years 7 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...