518 search results - page 42 / 104 » Beating a Random Assignment |
145
click to vote
MST
2002
15 years 2 months ago
2002
Abstract. In this paper we consider communication issues arising in cellular (mobile) networks that utilize frequency division multiplexing (FDM) technology. In such networks, many...
110
Voted
BMCBI
2007
15 years 2 months ago
2007
Background: False occurrences of functional motifs in protein sequences can be considered as random events due solely to the sequence composition of a proteome. Here we use a nume...
143
click to vote
IEEEPACT
1997
IEEE
15 years 6 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
145
click to vote
CCR
2004
15 years 2 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
146
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: Ranked gene lists from microarray experiments are usually analysed by assigning significance to predefined gene categories, e.g., based on functional annotations. Tool...