Sciweavers

1477 search results - page 29 / 296
» Complexity of (iterated) dominance
Sort
View
APWEB
2010
Springer
15 years 6 months ago
A Space and Time Efficient Algorithm for SimRank Computation
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
Weiren Yu, Xuemin Lin, Jiajin Le
139
Voted
ICIP
2005
IEEE
16 years 7 months ago
Largest-eigenvalue-theory for incremental principal component analysis
In this paper, we present a novel algorithm for incremental principal component analysis. Based on the LargestEigenvalue-Theory, i.e. the eigenvector associated with the largest ei...
Shuicheng Yan, Xiaoou Tang
ISPAN
2005
IEEE
15 years 11 months ago
A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars
Most high-end switches use an input-queued or a combined input- and output-queued architecture. The switch fabrics of these architectures commonly use an iterative scheduling syst...
Kevin F. Chen, Edwin Hsing-Mean Sha, S. Q. Zheng
PIMRC
2010
IEEE
15 years 4 months ago
Low-complexity iteration control for MIMO-BICM systems
Air bandwidth is a precious resource for wireless communication. Multiple-antenna (MIMO) systems enable an increase in channel capacity without increasing the air bandwidth. An ite...
C. Gimmler, Timo Lehnigk-Emden, Norbert Wehn
TARK
2005
Springer
15 years 11 months ago
Order independence and rationalizability
Two natural strategy elimination procedures have been studied for strategic games. The first one involves the notion of (strict, weak, etc) dominance and the second the notion of...
Krzysztof R. Apt