387 search results - page 26 / 78 » Many Random Walks Are Faster Than One |
ICTAI
2003
IEEE
14 years 2 months ago
2003
IEEE
Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping t...
VLDB
1999
ACM
14 years 1 months ago
1999
ACM
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Low-rank approximations which are computed from selected rows and columns of a given data matrix have attracted considerable attention lately. They have been proposed as an altern...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
BMCBI
2008
13 years 9 months ago
2008
Background: The availability of various high-throughput experimental and computational methods allows biologists to rapidly infer functional relationships between genes. It is oft...