2020 search results - page 12 / 404 » Speeding up Slicing |
WAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
ASIACRYPT
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
— We consider cell-based switch architectures, whose internal switching matrix does not provide enough speed to avoid input buffering. These architectures require a scheduling al...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
In this paper we introduce a method for computing fitness in evolutionary learning systems based on NVIDIA’s massive parallel technology using the CUDA library. Both the match ...
IWANN
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can...