5115 search results - page 631 / 1023 » On Randomized Lanczos Algorithms |
193
click to vote
CCS
2010
ACM
15 years 5 months ago
2010
ACM
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
172
click to vote
PIMRC
2010
IEEE
15 years 4 months ago
2010
IEEE
We consider the problem of multi-cell downlink beamforming with N cells and K terminals per cell. Cooperation among base stations (BSs) has been found to increase the system throug...
178
click to vote
ICMCS
2009
IEEE
15 years 4 months ago
2009
IEEE
This paper presents a tool and a novel Fast Invariant Transform (FIT) algorithm for language independent e-documents access. The tool enables a person to access an e-document thro...
164
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
195
click to vote
TIP
2010
15 years 1 months ago
2010
In 1964 Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "r...