2570 search results - page 107 / 514 » Fast Algorithms For The Computation Of Ranklets |
65
Voted
JSC
2011
14 years 5 months ago
2011
Let Ω ≤ GLd(q) be a quasisimple classical group in its natural representation and let ∆ = NGLd(q)(Ω). We construct the projection from ∆ to ∆/Ω and provide fast, poly...
PDP
2002
IEEE
15 years 3 months ago
2002
IEEE
In this paper we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it has a ...
FTDCS
1995
IEEE
15 years 1 months ago
1995
IEEE
A VOD server handles various types of media such as continuous media (CM) and non-continuous media (NM). Conventional VOD server buffer scheduling algorithms like Round Robin (RR)...
ICDM
2010
IEEE
14 years 8 months ago
2010
IEEE
Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (...
112
Voted
CVPR
2007
IEEE
16 years 4 days ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...