Sciweavers

385 search results - page 27 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
CLUSTER
2007
IEEE
14 years 4 months ago
Balancing productivity and performance on the cell broadband engine
— The Cell Broadband Engine (BE) is a heterogeneous multicore processor, combining a general-purpose POWER architecture core with eight independent single-instructionmultiple-dat...
Sadaf R. Alam, Jeremy S. Meredith, Jeffrey S. Vett...
TROB
2008
123views more  TROB 2008»
13 years 10 months ago
iSAM: Incremental Smoothing and Mapping
We present incremental smoothing and mapping (iSAM), a novel approach to the simultaneous localization and mapping problem that is based on fast incremental matrix factorization. i...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
AAIM
2006
Springer
143views Algorithms» more  AAIM 2006»
14 years 4 months ago
A Compression-Boosting Transform for Two-Dimensional Data
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
Qiaofeng Yang, Stefano Lonardi, Avraham Melkman
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 7 months ago
Highly Accurate Fast Methods for Extraction and Sparsification of Substrate Coupling Based on Low-Rank Approximation
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
Joe Kanapka, Jacob White
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 2 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...