Sciweavers

ICASSP
2011
IEEE
12 years 8 months ago
Natural gradient approach in orthogonal matrix optimization using cayley transform
Matrix optimization with orthogonal constraints appear in a variety of application fields including signal and image processing. Several researchers have developed algorithms for...
Gen Hori
DM
1999
69views more  DM 1999»
13 years 4 months ago
Maximal sets of mutually orthogonal Latin squares
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in
David A. Drake, G. H. John van Rees, W. D. Wallis
COMBINATORICS
2004
75views more  COMBINATORICS 2004»
13 years 4 months ago
Nonexistence Results for Hadamard-like Matrices
The class of square (0, 1, -1)-matrices whose rows are nonzero and mutually orthogonal is studied. This class generalizes the classes of Hadamard and Weighing matrices. We prove t...
Justin D. Christian, Bryan L. Shader
ORDER
2008
100views more  ORDER 2008»
13 years 4 months ago
Orthogonal Surfaces and Their CP-Orders
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...
Stefan Felsner, Sarah Kappes
EOR
2007
104views more  EOR 2007»
13 years 4 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
CORR
2008
Springer
77views Education» more  CORR 2008»
13 years 4 months ago
Data-Oblivious Stream Productivity
Abstract. We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidabl...
Jörg Endrullis, Clemens Grabmayer, Dimitri He...
COMGEO
2008
ACM
13 years 4 months ago
Unfolding Manhattan Towers
We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthog...
Mirela Damian, Robin Y. Flatland, Joseph O'Rourke
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 4 months ago
Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters
Optimal (v, 4, 2, 1) optical orthogonal codes (OOC) with v <= 75 and v = 71 are classified up to equivalence. One (v, 4, 2, 1) OOC is presented for all v 181, for which an opt...
Tsonka Stefanova Baicheva, Svetlana Topalova
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
13 years 10 months ago
Latent Dirichlet Allocation and Singular Value Decomposition Based Multi-document Summarization
Multi-Document Summarization deals with computing a summary for a set of related articles such that they give the user a general view about the events. One of the objectives is th...
Rachit Arora, Balaraman Ravindran