Sciweavers

484 search results - page 5 / 97
» The number of convex permutominoes
Sort
View
DCG
2002
76views more  DCG 2002»
13 years 7 months ago
The Unit Distance Problem for Centrally Symmetric Convex Polygons
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
Bernardo M. Ábrego, Silvia Fernández...
COMGEO
2008
ACM
13 years 7 months ago
Decomposing a simple polygon into pseudo-triangles and convex polygons
In this paper we consider the problem of decomposing a simple polygon into subpolygons that exclusively use vertices of the given polygon. We allow two types of subpolygons: pseud...
Stefan Gerdjikov, Alexander Wolff
ICIP
2000
IEEE
14 years 9 months ago
Approximately Optimal Assignment for Unequal Loss Protection
This paper describes an algorithm that achieves an approximately optimal assignment of forward error correction to progressive data within the unequal loss protection framework [1...
Alexander E. Mohr, Richard E. Ladner, Eve A. Riski...
SIAMMAX
2011
92views more  SIAMMAX 2011»
12 years 10 months ago
A Condition for Convexity of a Product of Positive Definite Quadratic Forms
A sufficient condition for the convexity of a finite product of positive definite quadratic forms is given in terms of the condition numbers of the underlying matrices. When only...
Minghua Lin, Gord Sinnamon
TIT
2010
130views Education» more  TIT 2010»
13 years 2 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao