4966 search results - page 205 / 994 » its 2010 |
162
click to vote
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
147
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
133
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
—We present a generalized sampling theorem allowing reconstructions in arbitrary bases. The classical Shannon Sampling Theorem is a special case of our theorem. Specifically, we...
151
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
To maximize efficiency in time and space, allocations and deallocations, in the exact linear algebra library LinBox, must always occur in the founding scope. This provides a simpl...
218
click to vote
ECWEB
2010
Springer
15 years 5 months ago
2010
Springer
A recommendation system (or recommender) is an algorithm whose goal is to recommend products to potential users. To achieve its task, it uses information about some user preference...