Sciweavers

13603 search results - page 241 / 2721
» On the Computational Complexity of Cut-Reduction
Sort
View
STACS
2012
Springer
14 years 2 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
BMCBI
2010
175views more  BMCBI 2010»
15 years 6 months ago
Towards high performance computing for molecular structure prediction using IBM Cell Broadband Engine - an implementation perspe
Background: RNA structure prediction problem is a computationally complex task, especially with pseudo-knots. The problem is well-studied in existing literature and predominantly ...
S. P. T. Krishnan, Sim Sze Liang, Bharadwaj Veerav...
BMCBI
2007
219views more  BMCBI 2007»
15 years 6 months ago
MetaQTL: a package of new computational methods for the meta-analysis of QTL mapping experiments
Background: Integration of multiple results from Quantitative Trait Loci (QTL) studies is a key point to understand the genetic determinism of complex traits. Up to now many effor...
Jean-Baptiste Veyrieras, Bruno Goffinet, Alain Cha...
CORR
2006
Springer
132views Education» more  CORR 2006»
15 years 6 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
TC
2008
15 years 6 months ago
Computationally Efficient PKI-Based Single Sign-On Protocol, PKASSO for Mobile Devices
In an attempt to expand Public Key Infrastructure (PKI) usage to a ubiquitous and mobile computing environment, we found that the deployment of the PKI on a resource-constrained de...
Ki-Woong Park, Sang Seok Lim, Kyu Ho Park