908 search results - page 145 / 182 » From communication networks to fuzzy sets |
106
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...
PODC
2009
ACM
16 years 11 days ago
2009
ACM
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
118
click to vote
ICPP
1998
IEEE
15 years 4 months ago
1998
IEEE
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
100
click to vote
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
PODC
2009
ACM
16 years 11 days ago
2009
ACM
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...