Sciweavers

409 search results - page 47 / 82
» Iterative methods for computing generalized inverses
Sort
View
RTA
2005
Springer
15 years 8 months ago
On Tree Automata that Certify Termination of Left-Linear Term Rewriting Systems
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
104
Voted
DAC
2009
ACM
16 years 3 months ago
A direct integral-equation solver of linear complexity for large-scale 3D capacitance and impedance extraction
State-of-the-art integral-equation-based solvers rely on techniques that can perform a matrix-vector multiplication in O(N) complexity. In this work, a fast inverse of linear comp...
Wenwen Chai, Dan Jiao, Cheng-Kok Koh
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
15 years 8 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
122
Voted
MMB
2004
Springer
175views Communications» more  MMB 2004»
15 years 7 months ago
Sensitivity Analysis for MAP/MAP/1 Queues
A sensitivity analysis of a single-server, infinite-buffer queue with correlated arrivals and correlated service times is performed. We study and compare the isolated impact of (...
Armin Heindl
111
Voted
TOG
2008
156views more  TOG 2008»
15 years 2 months ago
Real-time motion retargeting to highly varied user-created morphologies
Character animation in video games--whether manually keyframed or motion captured--has traditionally relied on codifying skeletons early in a game's development, and creating...
Chris Hecker, Bernd Raabe, Ryan W. Enslow, John De...