3894 search results - page 561 / 779 » Approximation Algorithms for Biclustering Problems |
149
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...
128
click to vote
WIA
2009
Springer
15 years 10 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
114
click to vote
WAIM
2007
Springer
15 years 10 months ago
2007
Springer
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
114
click to vote
ICPPW
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
153
click to vote
ICCAD
1995
IEEE
15 years 7 months ago
1995
IEEE
In this paper we investigate activity-driven clock trees to reduce the dynamic power consumption of synchronous digital CMOS circuits. Sections of an activity-driven clock tree ca...