Sciweavers

14165 search results - page 351 / 2833
» The generalized two-server problem
Sort
View
OL
2010
140views more  OL 2010»
15 years 1 months ago
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
This article studies a degree-bounded generalization of independent sets called co-k-plexes. Constant factor approximation algorithms are developed for the maximum co-k-plex probl...
Balabhaskar Balasundaram, Shyam Sundar Chandramoul...
ICASSP
2011
IEEE
14 years 10 months ago
Interference self-mitigating beamforming for the K-user MIMO IC
This work studies distributed linear transmission strategies for the multiple-input multiple-output (MIMO) interference channel with multiple concurrent links. We introduce the no...
Jianqi Wang, Amitav Mukherjee, A. Lee Swindlehurst
ICASSP
2011
IEEE
14 years 10 months ago
Blind separation of multiple binary sources from one nonlinear mixture
We propose a new method for the blind separation of multiple binary signals from a single general nonlinear mixture. In addition to the usual independence assumption on the input ...
Konstantinos I. Diamantaras, Theophilos Papadimitr...
ECCC
2011
217views ECommerce» more  ECCC 2011»
14 years 10 months ago
ReachFewL = ReachUL
We show that two complexity classes introduced about two decades ago are equal. ReachUL is the class of problems decided by nondeterministic log-space machines which on every inpu...
Brady Garvin, Derrick Stolee, Raghunath Tewari, N....
PODS
2003
ACM
142views Database» more  PODS 2003»
16 years 6 months ago
Query containment and rewriting using views for regular path queries under constraints
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
Gösta Grahne, Alex Thomo