2200 search results - page 225 / 440 » Bloch's Constant is Computable |
189
click to vote
ASIACRYPT
2007
Springer
16 years 21 days ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
177
click to vote
ANCS
2005
ACM
16 years 3 days ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
189
click to vote
SAC
2004
ACM
15 years 12 months ago
2004
ACM
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
159
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
The tremendous growth of public interest in peer-to-peer systems in recent years has initiated a lot of research work on how to design efficient and robust overlay networks for t...
187
click to vote
SPAA
2004
ACM
15 years 12 months ago
2004
ACM
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...