ICASSP
2011
IEEE
13 years 4 months ago
2011
IEEE
We explore the feasibility of linear interference alignment (IA) in MIMO cellular networks. Each base station (BTS) has Nt transmit antennas, each mobile has Nr receive antennas, ...
TSP
2010
13 years 7 months ago
2010
Abstract-- Information theory provides a novel perspective on passive sonar performance analysis. This approach begins by partitioning the search space and then considers the probl...
SIAMCO
2002
14 years 2 days ago
2002
In this paper, we consider the optimal policy for a generator offering power into a wholesale electricity market operating under a pool arrangement. Anderson and Philpott [Math. Op...
DCG
1999
14 years 3 days ago
1999
A spherical -design on Sn-1 is a finite set such that, for all polynomials f of degree at most , the average of f over the set is equal to the average of f over the sphere Sn-1 . ...
COMBINATORICS
1999
14 years 3 days ago
1999
A Steiner triple system has a bicoloring with m color classes if the points are partitioned into m subsets and the three points in every block are contained in exactly two of the ...
TVLSI
2008
14 years 9 days ago
2008
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Max...
TIT
2008
14 years 10 days ago
2008
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...
SIAMCO
2008
14 years 11 days ago
2008
Abstract. Necessary conditions of optimality are derived for multiobjective optimal control problems with free end-time, in which the dynamics constraint is modeled as a nonconvex ...
ASPDAC
2007
ACM
14 years 4 months ago
2007
ACM
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
GD
1994
Springer
14 years 4 months ago
1994
Springer
We describe a set of necessary conditions for a given graph to be the visibility graph of a simple polygon. For every graph satisfying these conditions we show that a uniform rank ...