1632 search results - page 89 / 327 » On special numberings of hypergraphs |
188
click to vote
ASIACRYPT
2007
Springer
16 years 17 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 ...
174
click to vote
SIAMSC
2008
15 years 6 months ago
2008
In this Part II of this paper we first refine the analysis of error-free vector transformations presented in Part I. Based on that we present an algorithm for calculating the round...
181
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
The study of extremal problems on triangle areas was initiated in a series of papers by Erdos and Purdy in the early 1970s. In this paper we present new results on such problems, ...
267
click to vote
ICDE
1999
IEEE
16 years 7 months ago
1999
IEEE
Current database trigger systems have extremely limited scalability. This paper proposes a way to develop a truly scalable trigger system. Scalability to large numbers of trigger...
156
click to vote
CSE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—Extensive work has been devoted to private information retrieval and privacy preserving data mining. To protect user privacy from search engines, however, most current a...