Sciweavers

3894 search results - page 437 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
143
Voted
IJON
2008
114views more  IJON 2008»
15 years 4 months ago
A robust model for spatiotemporal dependencies
Real-world data sets such as recordings from functional magnetic resonance imaging often possess both spatial and temporal structure. Here, we propose an algorithm including such ...
Fabian J. Theis, Peter Gruber, Ingo R. Keck, Elmar...
TWC
2008
148views more  TWC 2008»
15 years 4 months ago
ARMA Synthesis of Fading Channels
Computationally scalable and accurate estimation, prediction, and simulation of wireless communication channels is critical to the development of more adaptive transceiver algorith...
Hani Mehrpouyan, Steven D. Blostein
KDD
2008
ACM
150views Data Mining» more  KDD 2008»
16 years 5 months ago
Hypergraph spectral learning for multi-label classification
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
Liang Sun, Shuiwang Ji, Jieping Ye
COCO
2009
Springer
131views Algorithms» more  COCO 2009»
15 years 11 months ago
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
Joshua Brody, Amit Chakrabarti
INFOCOM
2012
IEEE
13 years 7 months ago
FemtoCaching: Wireless video content delivery through distributed caching helpers
Abstract—We suggest a novel approach to handle the ongoing explosive increase in the demand for video content in wireless/mobile devices. We envision femtocell-like base stations...
Negin Golrezaei, Karthikeyan Shanmugam, Alexandros...