1057 search results - page 84 / 212 » Accelerating the LSTRS Algorithm |
109
Voted
LATINCRYPT
2010
14 years 11 months ago
2010
We describe an FPGA accelerator for the Kannan–Fincke– Pohst enumeration algorithm (KFP) solving the Shortest Lattice Vector Problem (SVP). This is the first FPGA implementati...
100
click to vote
RTCSA
2007
IEEE
15 years 7 months ago
2007
IEEE
In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to explo...
140
click to vote
IJCAI
2007
15 years 2 months ago
2007
This work presents a new algorithm, called Heuristically Accelerated Minimax-Q (HAMMQ), that allows the use of heuristics to speed up the wellknown Multiagent Reinforcement Learni...
92
Voted
WSCG
2004
15 years 2 months ago
2004
In this article we present a visualisation algorithm based on image warping. A source data for the algorithm is a set of images with colour and depth information rendered for the ...
105
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
Median-shift is a mode seeking algorithm that relies on
computing the median of local neighborhoods, instead of
the mean. We further combine median-shift with Locality
Sensitive...