Results 1  10
of
109
Blind separation of speech mixtures via timefrequency masking
 IEEE TRANSACTIONS ON SIGNAL PROCESSING (2002) SUBMITTED
, 2004
"... Binary timefrequency masks are powerful tools for the separation of sources from a single mixture. Perfect demixing via binary timefrequency masks is possible provided the timefrequency representations of the sources do not overlap: a condition we calldisjoint orthogonality. We introduce here t ..."
Abstract

Cited by 322 (5 self)
 Add to MetaCart
dimensional (2D) histogram constructed from the ratio of the timefrequency representations of the mixtures that is shown to have one peak for each source with peak location corresponding to the relative attenuation and delay mixing parameters. The histogram is used to create timefrequency masks that partition
On rectangular partitionings in two dimensions: algorithms, complexity and applications
, 1998
"... Partitioning a multidimensional data set into rectangular partitions subject to certain constraints is an important problem that arises in many database applications, including histogrambased selectivity estimation, loadbalancing, and construction of index structures. While provably optimal and ..."
Abstract

Cited by 57 (7 self)
 Add to MetaCart
Partitioning a multidimensional data set into rectangular partitions subject to certain constraints is an important problem that arises in many database applications, including histogrambased selectivity estimation, loadbalancing, and construction of index structures. While provably optimal
qDistributions on boxed plane partitions
 Selecta Mathematica, New Series
"... We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon’s product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of these weights that are related to orthogonal polynomials; t ..."
Abstract

Cited by 24 (9 self)
 Add to MetaCart
We introduce elliptic weights of boxed plane partitions and prove that they give rise to a generalization of MacMahon’s product formula for the number of plane partitions in a box. We then focus on the most general positive degenerations of these weights that are related to orthogonal polynomials
Binary Space Partitions of Orthogonal Subdivisions
"... We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in dspace. We show that a subdivision with n boxes can be refined into a BSP of size O(n d+13), for all d * 3, and that such a partition can be computed in time O(K ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in dspace. We show that a subdivision with n boxes can be refined into a BSP of size O(n d+13), for all d * 3, and that such a partition can be computed in time O
Common Developments of Several Different Orthogonal Boxes
, 2011
"... We investigate the problem of finding common developments that fold to plural incongruent orthogonal boxes. It was shown that there are infinitely many orthogonal polygons that fold to two incongruent orthogonal boxes in 2008. In this paper, we first show that there is an orthogonal polygon that fol ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate the problem of finding common developments that fold to plural incongruent orthogonal boxes. It was shown that there are infinitely many orthogonal polygons that fold to two incongruent orthogonal boxes in 2008. In this paper, we first show that there is an orthogonal polygon
Binary Space Partition for Orthogonal Fat Rectangles
"... Abstract We generate a binary space partition (BSP) of size O(n log8 n) and depth O(log4 n) for n orthogonal fat rectangles in threespace, improving earlier bounds of Agarwal et al. We also give a lower bound construction showing that the size of an orthogonal BSP for these objects is \Omega (n log ..."
Abstract
 Add to MetaCart
Abstract We generate a binary space partition (BSP) of size O(n log8 n) and depth O(log4 n) for n orthogonal fat rectangles in threespace, improving earlier bounds of Agarwal et al. We also give a lower bound construction showing that the size of an orthogonal BSP for these objects is \Omega (n
Identities for Classical Group Characters of Nearly Rectangular Shape
 J. Algebra
, 1998
"... We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly" rectangular, by which we mean that the shapes are ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We derive several identities that feature irreducible characters of the general linear, the symplectic, the orthogonal, and the special orthogonal groups. All the identities feature characters that are indexed by shapes that are "nearly" rectangular, by which we mean that the shapes
ThreeDimensional Orthogonal Graph Drawing with Optimal Volume
"... An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axisaligned boxes, and edges represented by paths in the grid which only possibly intersect at common endpoints. In this paper, we study threedimensional orthogonal drawings and prov ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axisaligned boxes, and edges represented by paths in the grid which only possibly intersect at common endpoints. In this paper, we study threedimensional orthogonal drawings
c SACAM Strongly Coupled Partitioned FSI Using Proper Orthogonal Decomposition
, 2012
"... Abstract—In this paper we present a strong coupling algorithm for partitioned fluidstructure interactions which can be applied to blackbox field solvers. The coupling algorithm constructs an approximate interface Jacobian of the coupled fluidstructure problem using proper orthogonal decomposition ..."
Abstract
 Add to MetaCart
Abstract—In this paper we present a strong coupling algorithm for partitioned fluidstructure interactions which can be applied to blackbox field solvers. The coupling algorithm constructs an approximate interface Jacobian of the coupled fluidstructure problem using proper orthogonal
When Can You Tile a Box with Translates of Two Given Rectangular Bricks?
 Electr. J. Combin
, 2004
"... When can a ddimensional rectangular box R be tiled by translates of two given ddimensional rectangular bricks B 1 and B 2 ?WeprovethatR can be tiled by translates of B 1 and B 2 if and only if R can be partitioned by a hyperplane into two subboxes R 1 and R 2 such that R i can be tiled by transl ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
When can a ddimensional rectangular box R be tiled by translates of two given ddimensional rectangular bricks B 1 and B 2 ?WeprovethatR can be tiled by translates of B 1 and B 2 if and only if R can be partitioned by a hyperplane into two subboxes R 1 and R 2 such that R i can be tiled
Results 1  10
of
109