Sciweavers

4137 search results - page 595 / 828
» On the number of matchings of a tree
Sort
View
JCSS
2008
90views more  JCSS 2008»
13 years 8 months ago
Fault tolerance in cellular automata at high fault rates
A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply ...
Mark McCann, Nicholas Pippenger
CORR
2007
Springer
130views Education» more  CORR 2007»
13 years 8 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
SIAMCOMP
2008
167views more  SIAMCOMP 2008»
13 years 8 months ago
Approximation Algorithms for Data Placement Problems
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
Ivan D. Baev, Rajmohan Rajaraman, Chaitanya Swamy
TJS
2008
105views more  TJS 2008»
13 years 8 months ago
Using a relational database for scalable XML search
XML is a flexible and powerful tool that enables information and security sharing in heterogeneous environments. Scalable technologies are needed to effectively manage the growing...
Rebecca Cathey, Steven M. Beitzel, Eric C. Jensen,...
BMCBI
2004
94views more  BMCBI 2004»
13 years 8 months ago
GASP: Gapped Ancestral Sequence Prediction for proteins
Background: The prediction of ancestral protein sequences from multiple sequence alignments is useful for many bioinformatics analyses. Predicting ancestral sequences is not a sim...
Richard J. Edwards, Denis C. Shields