Sciweavers

4137 search results - page 578 / 828
» On the number of matchings of a tree
Sort
View
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
13 years 9 months ago
Ranged hash functions and the price of churn
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
James Aspnes, Muli Safra, Yitong Yin
BMCBI
2008
123views more  BMCBI 2008»
13 years 8 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
BMCBI
2007
102views more  BMCBI 2007»
13 years 8 months ago
Setting up a large set of protein-ligand PDB complexes for the development and validation of knowledge-based docking algorithms
Background: The number of algorithms available to predict ligand-protein interactions is large and ever-increasing. The number of test cases used to validate these methods is usua...
Luis A. Diago, Persy Morell, Longendri Aguilera, E...
JACM
2006
134views more  JACM 2006»
13 years 8 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
SIAMCOMP
2008
107views more  SIAMCOMP 2008»
13 years 8 months ago
Holographic Algorithms
Leslie Valiant recently proposed a theory of holographic algorithms. These novel algorithms achieve exponential speed-ups for certain computational problems compared to naive algo...
Leslie G. Valiant