Sciweavers

1724 search results - page 31 / 345
» Abstract Interpreters for Free
Sort
View
FLOPS
2006
Springer
14 years 1 months ago
Lock Free Data Structures Using STM in Haskell
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
Anthony Discolo, Tim Harris, Simon Marlow, Simon L...
HCI
2007
13 years 11 months ago
Pictogram Retrieval Based on Collective Semantics
Abstract. To retrieve pictograms having semantically ambiguous interpretations, we propose a semantic relevance measure which uses pictogram interpretation words collected from a w...
Heeryon Cho, Toru Ishida, Rieko Inaba, Toshiyuki T...
NIPS
2001
13 years 11 months ago
MIME: Mutual Information Minimization and Entropy Maximization for Bayesian Belief Propagation
Bayesian belief propagation in graphical models has been recently shown to have very close ties to inference methods based in statistical physics. After Yedidia et al. demonstrate...
Anand Rangarajan, Alan L. Yuille
WDAG
2005
Springer
80views Algorithms» more  WDAG 2005»
14 years 3 months ago
Obstruction-Free Algorithms Can Be Practically Wait-Free
Abstract. The obstruction-free progress condition is weaker than previous nonblocking progress conditions such as lock-freedom and waitfreedom, and admits simpler implementations t...
Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir...
ICFP
2010
ACM
13 years 10 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...