Sciweavers

19 search results - page 2 / 4
» Sequential and Parallel Attack Tree Modelling
Sort
View
IPPS
1997
IEEE
13 years 9 months ago
d-Dimensional Range Search on Multicomputers
The range tree is a fundamental data structure for multidimensional point sets, and as such, is central in a wide range of geometric anddatabaseapplications. Inthis paper, we desc...
Afonso Ferreira, Claire Kenyon, Andrew Rau-Chaplin...
HICSS
2008
IEEE
142views Biometrics» more  HICSS 2008»
13 years 5 months ago
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
Yamin Li, Shietung Peng, Wanming Chu
IPPS
2006
IEEE
13 years 11 months ago
Phylospaces: reconstructing evolutionary trees in tuple space
Phylospaces is a novel framework for reconstructing evolutionary trees in tuple space, a distributed shared memory that permits processes to communicate and coordinate with each o...
Marc L. Smith, Tiffani L. Williams
IPPS
1999
IEEE
13 years 9 months ago
Average-Case Analysis of Isospeed Scalability of Parallel Computations on Multiprocessors
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
Keqin Li, Xian-He Sun
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
13 years 9 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink