Sciweavers

489 search results - page 42 / 98
» A Method for Accelerating the HITS Algorithm
Sort
View
AMC
2005
138views more  AMC 2005»
13 years 7 months ago
Optimal centers in branch-and-prune algorithms for univariate global optimization
We present an interval branch-and-prune algorithm for computing verified enclosures for the global minimum and all global minimizers of univariate functions subject to bound const...
D. G. Sotiropoulos, T. N. Grapsa
SIGGRAPH
1994
ACM
13 years 11 months ago
A clustering algorithm for radiosity in complex environments
We present an approach for accelerating hierarchical radiosity by clustering objects. Previous approaches constructed effective hierarchies by subdividing surfaces, but could not ...
Brian E. Smits, James Arvo, Donald P. Greenberg
PC
2002
118views Management» more  PC 2002»
13 years 7 months ago
Parallel algorithms for indefinite linear systems
Saddle-point problems give rise to indefinite linear systems that are challenging to solve via iterative methods. This paper surveys two recent techniques for solving such problem...
Ahmed H. Sameh, Vivek Sarin
DSD
2003
IEEE
107views Hardware» more  DSD 2003»
14 years 1 months ago
DYNORA: A New Caching Technique
Cache design for high performance computing requires the realization of two seemingly disjoint goals of higher hit ratios at reduced access times. Recent research advocates the us...
P. Srivatsan, P. B. Sudarshan, P. P. Bhaskaran
SAC
2006
ACM
13 years 7 months ago
Undue influence: eliminating the impact of link plagiarism on web search rankings
Link farm spam and replicated pages can greatly deteriorate link-based ranking algorithms like HITS. In order to identify and neutralize link farm spam and replicated pages, we lo...
Baoning Wu, Brian D. Davison