19866 search results - page 193 / 3974 » Computing all factorizations in *** |
140
click to vote
SIGCSE
2005
ACM
16 years 3 days ago
2005
ACM
This paper tells the story of a student initiative, driven by a desire to diversify the images that surround the field of computer science and those who work in it. Categories and...
171
click to vote
CAISE
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper presents a method to compute metrics that predict maintainability of a system with respect to its event processing. The metrics reflect the complexity of event...
157
click to vote
EUROCRYPT
1999
Springer
15 years 10 months ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
138
click to vote
SIGCSE
2002
ACM
15 years 6 months ago
2002
ACM
This technical report describes the participation of women in computing in more than 30 countries, by focussing on participation at undergraduate level. A brief discussion covers ...
165
click to vote
JSC
2010
15 years 5 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...