1021 search results - page 76 / 205 » Fast Approximate PCPs |
171
Voted
ISVC
2009
Springer
16 years 21 days ago
2009
Springer
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
173
Voted
WABI
2009
Springer
16 years 23 days ago
2009
Springer
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
154
click to vote
CIKM
2009
Springer
16 years 22 days 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...
174
Voted
BMCBI
2006
15 years 6 months ago
2006
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
184
Voted
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...