4007 search results - page 168 / 802 » Computation with imprecise probabilities |
136
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose an algorithm for estimating the common secondary structure, alignment, and posterior base pairing probabilities for two RNA sequences. A definition of structural align...
129
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
164
Voted
WWW
2005
ACM
15 years 9 months ago
2005
ACM
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
107
click to vote
ISPA
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we propose efficient routing algorithms for 2D torus with possible large number of faulty nodes. There is no presumption on the number and the distribution of faulty...
120
click to vote
EUROPAR
2001
Springer
15 years 8 months ago
2001
Springer
We consider a networking subsystem for message–passing clusters that uses two unidirectional queues for data transfers between the network interface card (NIC) and the lower prot...