7773 search results - page 140 / 1555 » On generalized Frame-Stewart numbers |
177
click to vote
CORR
2011
Springer
15 years 29 days 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...
173
click to vote
IACR
2011
14 years 5 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...
141
click to vote
ISSAC
2009
Springer
16 years 16 days 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...
140
click to vote
GECCO
2007
Springer
16 years 4 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...
177
click to vote
ANOR
2010
15 years 3 months ago
2010
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the ...