Sciweavers

550 search results - page 17 / 110
» pairing 2009
Sort
View
CHI
2009
ACM
15 years 10 months ago
In CMC we trust: the role of similarity
This paper examines how different forms of linguistic similarity in a text-chat environment relate to the establishment of interpersonal trust. Sixty-two pairs played an iterative...
Lauren E. Scissors, Alastair J. Gill, Kathleen Ger...
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
15 years 4 months ago
SLIDER: Mining Correlated Motifs in Protein-Protein Interaction Networks
Correlated motif mining (CMM) is the problem to find overrepresented pairs of patterns, called motif pairs, in interacting protein sequences. Algorithmic solutions for CMM thereb...
Peter Boyen, Frank Neven, Dries Van Dyck, Aalt-Jan...
ICDCS
2009
IEEE
15 years 6 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
PODC
2009
ACM
15 years 10 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
87
Voted
AAIP
2009
14 years 7 months ago
Synthesis of Functions Using Generic Programming
Abstract. This paper describes a very flexible way to synthesize functions matching a given predicate. This can be used to find general recursive functions or -terms obeying an inp...
Pieter W. M. Koopman, Rinus Plasmeijer