Sciweavers

1077 search results - page 12 / 216
» Approximate reduction of dynamic systems
Sort
View
VLDB
2007
ACM
174views Database» more  VLDB 2007»
14 years 7 months ago
An adaptive and dynamic dimensionality reduction method for high-dimensional indexing
Abstract The notorious "dimensionality curse" is a wellknown phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well-known approa...
Heng Tao Shen, Xiaofang Zhou, Aoying Zhou
COCOON
2001
Springer
13 years 12 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup
INFOCOM
2007
IEEE
14 years 1 months ago
Reduction of Quality (RoQ) Attacks on Dynamic Load Balancers: Vulnerability Assessment and Design Tradeoffs
—One key adaptation mechanism often deployed in networking and computing systems is dynamic load balancing. The goal from employing dynamic load balancers is to ensure that the o...
Mina Guirguis, Azer Bestavros, Ibrahim Matta, Yuti...
ICC
2007
IEEE
245views Communications» more  ICC 2007»
14 years 1 months ago
Low Complexity MMSE Vector Precoding Using Lattice Reduction for MIMO Systems
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...
Feng Liu, Ling-ge Jiang, Chen He