Sciweavers

22 search results - page 2 / 5
» The cell probe complexity of dynamic range counting
Sort
View
KDD
2002
ACM
148views Data Mining» more  KDD 2002»
14 years 10 months ago
Tumor cell identification using features rules
Advances in imaging techniques have led to large repositories of images. There is an increasing demand for automated systems that can analyze complex medical images and extract me...
Bin Fang, Wynne Hsu, Mong-Li Lee
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 10 months ago
The Accuracy of Tree-based Counting in Dynamic Networks
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
Supriya Krishnamurthy, John Ardelius, Erik Aurell,...
KIVS
2007
Springer
14 years 3 months ago
Dynamic Algorithms in Multi-user OFDM Wireless Cells
This paper presents several results on dynamic OFDMA systems. It addresses especially the algorithmic complexity involved with several resource allocation approaches, sub-optimal h...
James Gross
CCR
2008
170views more  CCR 2008»
13 years 10 months ago
Probe-Aided MulTCP: an aggregate congestion control mechanism
An aggregate congestion control mechanism, namely ProbeAided MulTCP (PA-MulTCP), is proposed in this paper. It is based on MulTCP, a proposal for enabling an aggregate to emulate ...
Fang-Chun Kuo, Xiaoming Fu
FOCS
1993
IEEE
14 years 1 months ago
Dynamic Word Problems
Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...