515 search results - page 96 / 103 » A Reduced Complexity Algorithm for Minimizing N-Detect Tests |
ATAL
2010
Springer
13 years 7 months ago
2010
Springer
As learning agents move from research labs to the real world, it is increasingly important that human users, including those without programming skills, be able to teach agents de...
COMGEO
2006
ACM
13 years 6 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
CVPR
2006
IEEE
14 years 8 months ago
2006
IEEE
Motion estimation for applications where appearance undergoes complex changes is challenging due to lack of an appropriate similarity function. In this paper, we propose to learn ...
FPGA
2005
ACM
14 years 7 days ago
2005
ACM
Floating-point Sparse Matrix-Vector Multiplication (SpMXV) is a key computational kernel in scientific and engineering applications. The poor data locality of sparse matrices sig...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— For the single-group multicast scenario, where K users are served with the same data by a base station equipped with N antennas, we present two beamforming algorithms which out...