Sciweavers

6365 search results - page 464 / 1273
» Fast Local Computation Algorithms
Sort
View
IPPS
2010
IEEE
15 years 5 months ago
Exploiting inter-thread temporal locality for chip multithreading
Multi-core organizations increasingly support multiple threads per core. Threads on a core usually share a single first-level data cache, so thread schedulers must try to minimize ...
Jiayuan Meng, Jeremy W. Sheaffer, Kevin Skadron
RECOMB
2010
Springer
15 years 5 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals
IEEEICCI
2009
IEEE
15 years 5 months ago
Learning from an ensemble of Receptive Fields
Abstract-In this paper, we construct a neural-inspired computational model based on the representational capabilities of receptive fields. The proposed model, known as Shape Encodi...
Hanlin Goh, Joo Hwe Lim, Chai Quek
GECCO
2003
Springer
153views Optimization» more  GECCO 2003»
16 years 25 days ago
SEPA: Structure Evolution and Parameter Adaptation in Feed-Forward Neural Networks
Abstract. In developing algorithms that dynamically changes the structure and weights of ANN (Artificial Neural Networks), there must be a proper balance between network complexit...
Paulito P. Palmes, Taichi Hayasaka, Shiro Usui
TMM
2002
130views more  TMM 2002»
15 years 7 months ago
Computable scenes and structures in films
In this paper, we present a computational scene model and also derive novel algorithms for computing audio and visual scenes and within-scene structures in films. We use constraint...
Hari Sundaram, Shih-Fu Chang