774 search results - page 29 / 155 » Factors of generalized Fermat numbers |
SIGCSE
2010
ACM
14 years 3 months ago
2010
ACM
This paper details the results of an investigation into the compatibility of partnered computer science students. The study involved approximately 290 students at the University o...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we prove for the first time that the learning complexity of Rocchio’s algorithm is O(d+d2 (log d+log n)) over the discretized vector space {0, . . . , n − 1}d ,...
ICPP
2000
IEEE
14 years 26 days ago
2000
IEEE
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-l...
SIAMCOMP
1998
13 years 8 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
WASA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...