2095 search results - page 119 / 419 » Improved pebbling bounds |
108
Voted
IJVR
2008
15 years 1 months ago
2008
Real-time virtual heritage application is normally executed with a high performance computer system. This is due to the complexity and highly computational cost which makes such sy...
104
Voted
CCE
2004
15 years 27 days ago
2004
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
162
Voted
WAW
2010
Springer
14 years 11 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
104
Voted
OTM
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Web portals hosting large-scale internet applications have become popular due to the variety of services they provide to their users. These portals are developed using co...
111
Voted
CPM
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...