4781 search results - page 100 / 957 » Complexity at large |
100
click to vote
ICC
2008
IEEE
15 years 9 months ago
2008
IEEE
— This paper introduces low-complexity block codes, termed pattern-eliminating codes (PEC), which achieve a potentially large performance improvement over channels with residual ...
123
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
124
Voted
CIG
2006
IEEE
15 years 8 months ago
2006
IEEE
The Voronoi game is a two-person game which is a model for a competitive facility location. The game is done on a continuous domain, and only two special cases (1-dimensional case ...
111
Voted
COCO
2005
Springer
15 years 8 months ago
2005
Springer
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
110
Voted
ISSAC
2005
Springer
15 years 8 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....