Sciweavers

17505 search results - page 3219 / 3501
» Use Cases as Workflows
Sort
View
195
Voted
FGCN
2007
IEEE
125views Communications» more  FGCN 2007»
15 years 6 months ago
Evaluation of a Simple Load Balancing Improvement for Reliable Server Pooling with Heterogeneous Server Pools
The IETF is currently standardizing a light-weight protocol framework for server redundancy and session failover: Reliable Server Pooling (RSerPool). It is the novel combination o...
Xing Zhou, Thomas Dreibholz, Erwin P. Rathgeb
ADHOC
2007
139views more  ADHOC 2007»
15 years 6 months ago
Bounded-distance multi-clusterhead formation in wireless ad hoc networks
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
Marco Aurélio Spohn, J. J. Garcia-Luna-Acev...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
15 years 6 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 6 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
BMCBI
2010
118views more  BMCBI 2010»
15 years 6 months ago
Testing for mean and correlation changes in microarray experiments: an application for pathway analysis
Background: Microarray experiments examine the change in transcript levels of tens of thousands of genes simultaneously. To derive meaningful data, biologists investigate the resp...
Mayer Alvo, Zhongzhu Liu, Andrew Williams, Carole ...
« Prev « First page 3219 / 3501 Last » Next »