Sciweavers

10997 search results - page 1993 / 2200
» On the Structure of Complete Sets
Sort
View
POPL
2008
ACM
16 years 1 months ago
Imperative self-adjusting computation
Self-adjusting computation enables writing programs that can automatically and efficiently respond to changes to their data (e.g., inputs). The idea behind the approach is to stor...
Umut A. Acar, Amal Ahmed, Matthias Blume
112
Voted
RECOMB
2006
Springer
16 years 1 months ago
A Study of Accessible Motifs and RNA Folding Complexity
mRNA molecules are folded in the cells and therefore many of their substrings may actually be inaccessible to protein and microRNA binding. The need to apply an accessability crite...
Ydo Wexler, Chaya Ben-Zaken Zilberstein, Michal Zi...
113
Voted
RECOMB
2005
Springer
16 years 1 months ago
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
137
Voted
RECOMB
2004
Springer
16 years 1 months ago
A random graph approach to NMR sequential assignment
Nuclear magnetic resonance (NMR) spectroscopy allows scientists to study protein structure, dynamics and interactions in solution. A necessary first step for such applications is ...
Chris Bailey-Kellogg, Sheetal Chainraj, Gopal Pand...
105
Voted
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
16 years 1 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys
« Prev « First page 1993 / 2200 Last » Next »