Sciweavers

15 search results - page 1 / 3
» ML(n)BiCGStab: Reformulation, Analysis and Implementation
Sort
View
CORR
2010
Springer
129views Education» more  CORR 2010»
13 years 5 months ago
ML(n)BiCGStab: Reformulation, Analysis and Implementation
With the help of index functions, we re-derive the ML(n)BiCGStab algorithm in [35] in a more systematic way. There are n ways to define the ML(n)BiCGStab residual vector. Each diff...
Man-Chung Yeung
CIKM
2010
Springer
13 years 2 months ago
Modeling reformulation using passage analysis
Query reformulation modifies the original query with the aim of better matching the vocabulary of the relevant documents, and consequently improving ranking effectiveness. Previou...
Xiaobing Xue, W. Bruce Croft, David A. Smith
AAAI
1990
13 years 6 months ago
Approximation Reformulations
Although computers are widely used to simulate complex physical systems, crafting the underlying models that enable computer analysis remains difficult. When a model is created fo...
Daniel S. Weld
RTCSA
2007
IEEE
13 years 11 months ago
Fast Schedulability Analysis Using Commodity Graphics Hardware
In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to explo...
Jimin Feng, Samarjit Chakraborty, Bertil Schmidt, ...
WWW
2005
ACM
14 years 5 months ago
A uniform approach to accelerated PageRank computation
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
Frank McSherry