Sciweavers

550 search results - page 86 / 110
» Context Semantics, Linear Logic and Computational Complexity
Sort
View
PLDI
2004
ACM
15 years 10 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
AGP
1999
IEEE
15 years 8 months ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...
SIGIR
2011
ACM
14 years 7 months ago
Fast context-aware recommendations with factorization machines
The situation in which a choice is made is an important information for recommender systems. Context-aware recommenders take this information into account to make predictions. So ...
Steffen Rendle, Zeno Gantner, Christoph Freudentha...
BMCBI
2010
113views more  BMCBI 2010»
15 years 4 months ago
ProbABEL package for genome-wide association analysis of imputed data
Background: Over the last few years, genome-wide association (GWA) studies became a tool of choice for the identification of loci associated with complex traits. Currently, impute...
Yurii S. Aulchenko, Maksim V. Struchalin, Cornelia...
CONCUR
2007
Springer
15 years 10 months ago
Asynchronous Games: Innocence Without Alternation
The notion of innocent strategy was introduced by Hyland and Ong in order to capture the interactive behaviour of λ-terms and PCF programs. An innocent strategy is defined as an ...
Paul-André Melliès, Samuel Mimram