549 search results - page 81 / 110 » Computing All the Best Swap Edges Distributively |
144
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
170
Voted
CIVR
2007
Springer
15 years 10 months ago
2007
Springer
Over the years, many Linear Discriminant Analysis (LDA) algorithms have been proposed for the study of high dimensional data in a large variety of problems. An intrinsic limitatio...
173
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: Orthology analysis is an important part of data analysis in many areas of bioinformatics such as comparative genomics and molecular phylogenetics. The ever-increasing ...
127
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
Scenario-based design exploits the time-varying execution behavior of applications by dynamically adapting the system on which they run. This is a particularly interesting design ...
159
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...