177 search results - page 23 / 36 » Geometric Applications of a Randomized Optimization Techniqu... |
134
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
125
Voted
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
145
Voted
PSB
2003
15 years 5 months ago
2003
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
134
click to vote
WSC
1997
15 years 5 months ago
1997
The problem of selecting the best system from a finite set of alternatives is considered from a Bayesian decision-theoretic perspective. The framework presented is quite general,...
192
Voted
SIAMJO
2011
14 years 6 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...