Sciweavers

580 search results - page 107 / 116
» On the Foundations of Answer Set Programming
Sort
View
TIT
2011
209views more  TIT 2011»
13 years 3 months ago
Belief Propagation and LP Relaxation for Weighted Matching in General Graphs
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
OOPSLA
2007
Springer
14 years 2 months ago
A rewriting approach to the design and evolution of object-oriented languages
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
Mark Hills, Grigore Rosu
ISCA
1994
IEEE
129views Hardware» more  ISCA 1994»
14 years 21 days ago
Software Versus Hardware Shared-Memory Implementation: A Case Study
We comparethe performance of software-supported shared memory on a general-purpose network to hardware-supported shared memory on a dedicated interconnect. Up to eight processors,...
Alan L. Cox, Sandhya Dwarkadas, Peter J. Keleher, ...
BMCBI
2006
134views more  BMCBI 2006»
13 years 8 months ago
A statistical score for assessing the quality of multiple sequence alignments
Background: Multiple sequence alignment is the foundation of many important applications in bioinformatics that aim at detecting functionally important regions, predicting protein...
Virpi Ahola, Tero Aittokallio, Mauno Vihinen, Esa ...
WABI
2009
Springer
127views Bioinformatics» more  WABI 2009»
14 years 3 months ago
Constructing Majority-Rule Supertrees
Background: Supertree methods combine the phylogenetic information from multiple partially-overlapping trees into a larger phylogenetic tree called a supertree. Several supertree ...
Jianrong Dong, David Fernández-Baca, Fred R...