15485 search results - page 139 / 3097 » Computing Optimal Subsets |
115
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
147
Voted
KDD
2007
ACM
16 years 2 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
127
click to vote
FOCS
2002
IEEE
15 years 7 months ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
106
Voted
SEMWEB
2009
Springer
15 years 9 months ago
2009
Springer
Given two classifications, or lightweight ontologies, we compute the minimal mapping, namely the subset of all possible correspondences, called mapping elements, between them such ...
91
Voted
PPSC
1997
15 years 3 months ago
1997
This article outlines the content and performance of some of the ScaLAPACK software. ScaLAPACK is a collection of mathematical software for linear algebra computations on distribu...