Sciweavers

6274 search results - page 1149 / 1255
» From query complexity to computational complexity
Sort
View
ICCV
2005
IEEE
15 years 10 months ago
Fast Global Kernel Density Mode Seeking with Application to Localisation and Tracking
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
Chunhua Shen, Michael J. Brooks, Anton van den Hen...
NDSS
2005
IEEE
15 years 10 months ago
One-Way Isolation: An Effective Approach for Realizing Safe Execution Environments
In this paper, we present an approach for realizing a safe execution environment (SEE) that enables users to “try out” new software (or configuration changes to existing soft...
Weiqing Sun, Zhenkai Liang, V. N. Venkatakrishnan,...
SPAA
2005
ACM
15 years 10 months ago
Fast construction of overlay networks
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
Dana Angluin, James Aspnes, Jiang Chen, Yinghua Wu...
FPGA
2005
ACM
195views FPGA» more  FPGA 2005»
15 years 10 months ago
Sparse Matrix-Vector multiplication on FPGAs
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...
Ling Zhuo, Viktor K. Prasanna
CF
2004
ACM
15 years 9 months ago
Improving the execution time of global communication operations
Many parallel applications from scientific computing use MPI global communication operations to collect or distribute data. Since the execution times of these communication opera...
Matthias Kühnemann, Thomas Rauber, Gudula R&u...
« Prev « First page 1149 / 1255 Last » Next »