Sciweavers

4137 search results - page 463 / 828
» On the number of matchings of a tree
Sort
View
IPPS
2006
IEEE
16 years 27 days ago
Topology-aware task mapping for reducing communication contention on large parallel machines
Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies ...
T. Agarwal, Amit Sharma, A. Laxmikant, Laxmikant V...
DASFAA
2005
IEEE
120views Database» more  DASFAA 2005»
16 years 15 days ago
A New Indexing Method for High Dimensional Dataset
Indexing high dimensional datasets has attracted extensive attention from many researchers in the last decade. Since R-tree type of index structures are known as suffering “curse...
Jiyuan An, Yi-Ping Phoebe Chen, Qinying Xu, Xiaofa...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
16 years 11 days ago
Fast Algorithms for Computing the Tripartition-Based Distance Between Phylogenetic Networks
Consider two phylogenetic networks N and N′ of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N′ . This distance i...
Nguyen Bao Nguyen, C. Thach Nguyen, Wing-Kin Sung
SSD
2005
Springer
105views Database» more  SSD 2005»
16 years 11 days ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
SSPR
2004
Springer
16 years 7 days ago
Clustering Variable Length Sequences by Eigenvector Decomposition Using HMM
We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Fatih Murat Porikli