7796 search results - page 196 / 1560 » On Generalized Schur Numbers |
184
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...
188
click to vote
IACR
2011
14 years 6 months ago
2011
We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can...
152
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
160
click to vote
GECCO
2007
Springer
16 years 23 days ago
2007
Springer
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
190
click to vote
DCC
1998
IEEE
15 years 11 months ago
1998
IEEE
Multiple description coding (MDC) is source coding for multiple channels such that a decoder which receives an arbitrary subset of the channels may produce a useful reconstruction...