3894 search results - page 648 / 779 » Approximation Algorithms for Biclustering Problems |
117
Voted
ICCAD
2001
IEEE
16 years 10 days ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
155
Voted
JSAC
2007
15 years 3 months ago
2007
Abstract— Cooperative diversity facilitates spatio-temporal communications without requiring the deployment of physical antenna arrays. While physical layer studies on cooperativ...
149
click to vote
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
135
Voted
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
271
Voted
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...