Sciweavers

1215 search results - page 152 / 243
» Combinatorics
Sort
View
127
Voted
COMBINATORICS
2007
60views more  COMBINATORICS 2007»
15 years 3 months ago
Higher Spin Alternating Sign Matrices
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
Roger E. Behrend, Vincent A. Knight
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
15 years 3 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie
128
Voted
COMBINATORICS
2007
112views more  COMBINATORICS 2007»
15 years 3 months ago
Reversal Distance for Strings with Duplicates: Linear Time Approximation using Hitting Set
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
Petr Kolman, Tomasz Walen
158
Voted
IACR
2011
152views more  IACR 2011»
14 years 3 months ago
Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...
Helger Lipmaa
166
Voted
CVPR
2012
IEEE
13 years 6 months ago
Unsupervised learning of translation invariant occlusive components
We study unsupervised learning of occluding objects in images of visual scenes. The derived learning algorithm is based on a probabilistic generative model which parameterizes obj...
Zhenwen Dai, Jörg Lücke