Sciweavers

4137 search results - page 571 / 828
» On the number of matchings of a tree
Sort
View
DMCS
2003
13 years 9 months ago
A Reciprocity Theorem for Monomer-Dimer Coverings
The problem of counting the number of monomer-dimer coverings of a lattice comes from the field of statistical mechanics. It has only been shown to be exactly solved for the speci...
Nick Anzalone, John Baldwin, Ilya Bronshtein, T. K...
NIPS
2004
13 years 9 months ago
Large-Scale Prediction of Disulphide Bond Connectivity
The formation of disulphide bridges among cysteines is an important feature of protein structures. Here we develop new methods for the prediction of disulphide bond connectivity. ...
Pierre Baldi, Jianlin Cheng, Alessandro Vullo
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 9 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
RECSYS
2010
ACM
13 years 8 months ago
Interactive recommendations in social endorsement networks
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...
Theodoros Lappas, Dimitrios Gunopulos
DSD
2010
IEEE
172views Hardware» more  DSD 2010»
13 years 8 months ago
Adaptive Cache Memories for SMT Processors
Abstract—Resizable caches can trade-off capacity for access speed to dynamically match the needs of the workload. In Simultaneous Multi-Threaded (SMT) cores, the caching needs ca...
Sonia López, Oscar Garnica, David H. Albone...