Sciweavers

280 search results - page 16 / 56
» On matrices with the Edmonds-Johnson property
Sort
View
FOCS
2010
IEEE
13 years 5 months ago
Testing Properties of Sparse Images
We initiate the study of testing properties of images that correspond to sparse 0/1-valued matrices of size n
Gilad Tsur, Dana Ron
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
14 years 1 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu
CG
2004
Springer
13 years 7 months ago
Surface processing methods for point sets using finite elements
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...
Ulrich Clarenz, Martin Rumpf, Alexandru Telea
SETA
2010
Springer
175views Mathematics» more  SETA 2010»
13 years 6 months ago
New Constructions of Complete Non-cyclic Hadamard Matrices, Related Function Families and LCZ Sequences
A Hadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three...
Krystal Guo, Guang Gong
SAC
2009
ACM
14 years 2 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand