Sciweavers

18 search results - page 3 / 4
» Improved typings for probabilistic noninterference in a mult...
Sort
View
EMNLP
2009
13 years 5 months ago
A Probabilistic Model for Associative Anaphora Resolution
This paper proposes a probabilistic model for associative anaphora resolution in Japanese. Associative anaphora is a type of bridging anaphora, in which the anaphor and its antece...
Ryohei Sasano, Sadao Kurohashi
ICFP
2009
ACM
14 years 8 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
ASPLOS
2010
ACM
14 years 2 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
CIKM
2008
Springer
13 years 9 months ago
Modeling multi-step relevance propagation for expert finding
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...
Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
CIKM
2009
Springer
13 years 8 months ago
Retrieval experiments using pseudo-desktop collections
Desktop search is an important part of personal information management (PIM). However, research in this area has been limited by the lack of shareable test collections, making cum...
Jinyoung Kim, W. Bruce Croft