Sciweavers

204 search results - page 18 / 41
» A Half-Million Strong at Least
Sort
View
INFOCOM
2011
IEEE
14 years 3 months ago
Converge-cast with MIMO
—This paper investigates throughput and delay based on a newly predominant traffic pattern, called converge-cast, where each of the n nodes in the network act as a destination w...
Luoyi Fu, Yi Qin, Xinbing Wang, Xue Liu
INFOCOM
2011
IEEE
14 years 3 months ago
A prior-free revenue maximizing auction for secondary spectrum access
—Dynamic spectrum allocation has proven promising for mitigating the spectrum scarcity problem. In this model, primary users lease chunks of under-utilized spectrum to secondary ...
Ajay Gopinathan, Zongpeng Li
STACS
2012
Springer
13 years 7 months ago
Linear-Space Data Structures for Range Mode Query in Arrays
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
Timothy M. Chan, Stephane Durocher, Kasper Green L...
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 5 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze
BMCBI
2007
167views more  BMCBI 2007»
14 years 12 months ago
Applying negative rule mining to improve genome annotation
Background: Unsupervised annotation of proteins by software pipelines suffers from very high error rates. Spurious functional assignments are usually caused by unwarranted homolog...
Irena I. Artamonova, Goar Frishman, Dmitrij Frishm...