Sciweavers

545 search results - page 71 / 109
» A Dynamic Method for the Evaluation and Comparison of Imputa...
Sort
View
SPAA
1994
ACM
14 years 17 days ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
ICCV
2011
IEEE
12 years 8 months ago
A String of Feature Graphs Model for Recognition of Complex Activities in Natural Videos
Videos usually consist of activities involving interactions between multiple actors, sometimes referred to as complex activities. Recognition of such activities requires modeling ...
Utkarsh Gaur, Yingying Zhu, Bi Song, Amit Roy-Chow...
BMCBI
2006
146views more  BMCBI 2006»
13 years 8 months ago
Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training
Background: Particle Swarm Optimization (PSO) is an established method for parameter optimization. It represents a population-based adaptive optimization technique that is influen...
Michael Meissner, Michael Schmuker, Gisbert Schnei...

Presentation
945views
13 years 5 months ago
On the use of discrete Pascal transform in hiding data in images
The Discrete Pascal Transform (DPT) has been proved remarkably useful for edge detection, filter design, discrete-time signal interpolation and data hiding. In the present work a n...
IPPS
1999
IEEE
14 years 24 days ago
A Graph Based Framework to Detect Optimal Memory Layouts for Improving Data Locality
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...