Sciweavers

2497 search results - page 311 / 500
» Requirements for models of achievable routing
Sort
View
CORR
2010
Springer
253views Education» more  CORR 2010»
15 years 6 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
PE
2006
Springer
125views Optimization» more  PE 2006»
15 years 6 months ago
Approximating multi-skill blocking systems by HyperExponential Decomposition
We consider multi-class blocking systems in which jobs require a single processing step. There are groups of servers that can each serve a different subset of all job classes. The...
Geert Jan Franx, Ger Koole, Auke Pot
SYNTHESE
2008
114views more  SYNTHESE 2008»
15 years 6 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
TCAD
2008
114views more  TCAD 2008»
15 years 6 months ago
RUMBLE: An Incremental Timing-Driven Physical-Synthesis Optimization Algorithm
Physical synthesis tools are responsible for achieving timing closure. Starting with 130nm designs, multiple cycles are required to cross the chip, making latch placement critical...
David A. Papa, Tao Luo, Michael D. Moffitt, Chin-N...
164
Voted
TMC
2008
110views more  TMC 2008»
15 years 6 months ago
Understanding the Impact of Interference on Collaborative Relays
Collaborative relays achieve the benefits of spatial diversity without requiring physical antenna arrays at end devices. While many studies have demonstrated its effectiveness in a...
Yan Zhu, Haitao Zheng