1730 search results - page 204 / 346 » Algebra and Computation |
150
click to vote
FOCS
2006
IEEE
15 years 10 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
122
click to vote
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
130
Voted
COORDINATION
2004
Springer
15 years 9 months ago
2004
Springer
Linda tuple spaces are flat and unstructured, in the sense that they do not allow for expressing preferences of tuples; for example, we could be interested in indicating tuples th...
125
click to vote
EMSOFT
2004
Springer
15 years 9 months ago
2004
Springer
Embedded systems are electronic devices that function in the context of a real environment, by sensing and reacting to a set of stimuli. Because of their close interaction with th...
120
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...