Sciweavers

6365 search results - page 805 / 1273
» Fast Local Computation Algorithms
Sort
View
IH
2009
Springer
16 years 2 months ago
Estimating Steganographic Fisher Information in Real Images
This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the dis...
Andrew D. Ker
ISSAC
2009
Springer
155views Mathematics» more  ISSAC 2009»
16 years 2 months ago
Parallel sparse polynomial multiplication using heaps
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...
Michael B. Monagan, Roman Pearce
ISDA
2008
IEEE
16 years 2 months ago
Multimodal Medical Image Registration Using Particle Swarm Optimization
In image guided surgery, the registration of preand intra-operative image data is an important issue. In registrations, we seek an estimate of the transformation that registers th...
Yen-Wei Chen, Chen-Lun Lin, Aya Mimori
WIOPT
2006
IEEE
16 years 1 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
FPGA
2005
ACM
121views FPGA» more  FPGA 2005»
16 years 1 months ago
Floating-point sparse matrix-vector multiply for FPGAs
Large, high density FPGAs with high local distributed memory bandwidth surpass the peak floating-point performance of high-end, general-purpose processors. Microprocessors do not...
Michael DeLorimier, André DeHon